• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.8
• /
• pp.656-661
• /
• 2013

In Guided Scrambling (GS) encoding for the holographic storage, after scrambling augmented source word into codeword, the best codeword satisfying modulation constraint is determined. Modulation constraints considered in this paper are strength which is the minimum number of transition between '0' and '1' in each row and column of codeword array and the symbol balancedness of codeword array. In this paper, we show that GS encoding procedure can be formulated as an integer programming model and develop a fast neighborhood search heuristic for fast computation of control bits. In the simulation, we compared the performance of heuristic algorithm with the integer programming model for various array and control bit size combinations.

• Journal of Korean Institute of Industrial Engineers
• /
• v.33 no.3
• /
• pp.373-380
• /
• 2007

In this paper, we consider a new lot-sizing and scheduling problem (LSSP) that minimizes the sum of production cost, setup cost and inventory cost. Setup carry-over and overlapping as well as demand splitting are considered. Also, maximum number of setups for each time period is not limited. For this LSSP, we have formulated a mixed integer programming (MIP) model, of which the size does not increase even if we divide a time period into a number of micro time periods. Also, we have developed an efficient heuristic algorithm by combining decomposition scheme with local search procedure. Test results show that the developed heuristic algorithm finds good quality (in practice, even better) feasible solutions using far less computation time compared with the CPLEX, a competitive MIP solver.

• IE interfaces
• /
• v.2 no.1
• /
• pp.37-45
• /
• 1989

Guide path design is the most important factor in planning automated guided vehicle systems(AGVS) in manufacturing shop environments. This paper studies a heuristic procedure to design an optimal bi-directional guide path with the objective of the minimum total travel time of the vehicles. An example is solved to validate the procedure developed.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.20 no.2
• /
• pp.77-93
• /
• 1995

A mathematical model for long-rage water supply planning was formulated as a dynamic plant location problem with network arc capacity expansion, and illustative example was presented. The proposed solution procedure identifies economical construction timings of surface water supply facilities and water conveyence systems and the best water supply operating patterns as well. In this study, we present a heuristic solution procedure using Simulated annealing Method in conjunction with Bertsekas & Tseng's RELAXT-II for the 0-1 integer network problem.

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10a
• /
• pp.607-612
• /
• 1993

In this paper, a heuristic procedure is presented which first determines the positions of adding storage tank. Then a nonlinear programming is formulated to obtain their optimum size. Flexible utilization(shared equipment) of storage tank is suggested. The effectiveness of this method is verified by solving two literature problems.

• Journal of Convergence Society for SMB
• /
• v.3 no.2
• /
• pp.19-25
• /
• 2013

Decision procedure was done with the evaluation of multi-criterion analysis. Importance of each criterion was considered through heuristically method, specially it was based on the heuristic least mean square algorithm. To consider coalition evaluation, it was carried out by calculation of Shapley index and Interaction value. The model output is also analyzed with the help of those two indexes, and the procedure was also displayed with details. Finally, the differences between the model output and the desired results are evaluated thoroughly, several problems are raised at the end of the example which require for further studying.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.4
• /
• pp.138-144
• /
• 1989

In this paper, a new method is proposed to remove the logical redundancy for the gate-level circuit optimization. In this method, only the fanout-branch signals in the circuits, not all the signals, are examined for redundancy. When a signal is determined to be nonredundant, other nonredundant signals are found out by the efficient procedure, using only the informations which are generated in the course of the redundancy-check. In order to avoid the re-examination of a signal for redudancy, a heuristic method is proposed to determine the redundancy-checking order of signals. The proposed method is heuristic, based on the VLSI test theory. It is much faster than other methods, since it does not reexamine a signal for redundancy.

• IE interfaces
• /
• v.16 no.1
• /
• pp.8-15
• /
• 2003

With rapid growth of internet technology, companies have developed an information system such as the electronic catalog for product data in the E-Business. Due to the heuristic nature of the catalog search for proper tools in the specific process, the intelligent and user friendly methods residing in the search process give a comfortable environment even for the beginners in the field. In this paper, we develop a web based catalog for machining tools especially in Milling process. It has two distinct procedures for the users of the catalog; Search and Analysis. The Search is to select a proper cutter, insert, component combination in the developed relational database based on the cutting process and material. The Analysis is to suggest a recommended optimal cutting conditions based on the machining tools and selected materials. All of these procedures are stored in a server with a program based on the ASP and Java Script where the procedure is initiated by the client using the internet which is accessed through insert. With the success on implementing the above engineering database in the internet, we can provide the foundation for developing PDM with heuristic procedure.

• Industrial Engineering and Management Systems
• /
• v.4 no.2
• /
• pp.165-175
• /
• 2005

Two extreme and one mixed procedures for designing a noise hazard prevention program are discussed in this paper. The two extreme design procedures (engineering-based and HPD-based) yield upper and lower bounds of the total noise control cost, respectively; while the mixed design procedure provides an optimal noise hazard prevention program within a given total budget. The upper bound of the workforce size for job rotation is approximated using a heuristic procedure. Six optimization models are developed and utilized by the mixed procedure to eliminate or reduce excessive noise levels (or noise exposures) in an industrial workplace. The mixed procedure also follows the OSHA’s hierarchy of noise control. A numerical example is given to demonstrate the application of the proposed design procedures.

• Management Science and Financial Engineering
• /
• v.2 no.1
• /
• pp.1-18
• /
• 1996

FMS operating system consists of several subsystems in general. i.e. tool grouping subsystem. tool/job assignment subsystem. job dispatching subsystem, and papers dealing with each subsystem were published by many researchers [1], [4], [6], [8], [9], [10], [11], [12], [13], [14], [15], [16]. This paper mainly discusses about tool/job assignment subsystem as a job loading procedure. that occupies the kernel position of overall FMS operating system. Its performance is evaluated through simulation experiments of an integrated operating system under a typical FMS hardware configuration implemented in many machining factories, which is composed of the proposed procedure as well as a job dispatching procedure including several heuristic dispatching rules in terms of rule-base.