• Proceedings of the Korea Society of Information Technology Applications Conference
• /
• 2007.11a
• /
• pp.146-146
• /
• 2007

• Journal of Korean Institute of Industrial Engineers
• /
• v.38 no.4
• /
• pp.262-275
• /
• 2012

This paper develops a multistage scheduling algorithm for the module operation of the LCD(Liquid Crystal Display) production systems and tests the efficiency of the proposed algorithm. The module operation is a multistage form composed of multiple sub operations of processes, and each stage is consists of multiple lines with the same kinds of machines. This paper presents a mathematical modeling reflecting the constraints of the LCD module operation and develops a multistage scheduling algorithm based on tabu search metaheuristic approach. For this purpose, an production order is assigned to a line of the sub operations and a sequence of the assigned order is rearranged to draw an efficient schedule. Simulation experiments test performance measures and show the efficiency of the proposed algorithm.

• Journal of Intelligence and Information Systems
• /
• v.13 no.3
• /
• pp.63-82
• /
• 2007

In this paper, we propose an adaptive hybrid genetic algorithm (ahGA) approach for effectively solving multistage-based scheduling problems in flexible manufacturing system (FMS) environment. The proposed ahGA uses a neighborhood search technique for local search and an adaptive scheme for regulation of GA parameters in order to improve the solution of FMS scheduling problem and to enhance the performance of genetic search process, respectively. In numerical experiment, we present two types of multistage-based scheduling problems to compare the performances of the proposed ahGA with conventional competing algorithms. Experimental results show that the proposed ahGA outperforms the conventional algorithms.

• Journal of Korean Institute of Industrial Engineers
• /
• v.11 no.2
• /
• pp.75-85
• /
• 1985

The application of GT results in the mass production effect to multi-product, small lot-sized production. Group scheduling, which is operations scheduling based on the GT concept, is analyzed in a multistage manufacturing system. But the research has been limited in independent setup time models. A heuristic algorithm has been developed to minimize the mean flow time when setup times are dependent to sequence of group in multistage. For evaluation of the heuristic algorithm, the solution of heuristic algorithm is compared with that of random scheduling. The result of comparison indicates that the proposed heuristic algorithm provides good solutions with relatively fewer computational effort.

• Journal of the Korean Society for Precision Engineering
• /
• v.12 no.6
• /
• pp.128-136
• /
• 1995

The problem addressed in this paper is that of the on-line computational burden of time-optimal control laws for quick, strongly nonlinear systems like revolute robots. It will be demonstrated that a large amount of off-line computation can be substituted for most of the on-line burden in cases of time optimization with constrained inputs if differential point-to- point specifications can be relaxed to cell-to-cell transitions. These cells result from a coarse discretization of likely swaths of state space into a set of nonuniform, contiguous volumes of relatively simple shapes. The cell boundaries approximate stream surfaces of the phase fluid and surfaces of equal transit times. Once the cells have been designed, the bang- bang schedules for the inputs are determined for all likely starting cells and terminating cells. The scheduling process is completed by treating all cells into which the trajectories might unex- pectedly stray as additional starting cells. Then an efficient-to-compute control law can be based on the resulting table of optimal strategies.

• Journal of Information Processing Systems
• /
• v.9 no.2
• /
• pp.301-314
• /
• 2013

In a parallel processing system, Multi-stage Interconnection Networks (MINs) play a vital role in making the network reliable and cost effective. The MIN is an important piece of architecture for a multiprocessor system, and it has a good impact in the field of communication. Optical Multi-stage Interconnection Networks (OMINs) are the advanced version of MINs. The main problem with OMINs is crosstalk. This paper, presents the (1) Destination Based Modified Omega Network (DBMON) and the (2) Destination Based Scheduling Algorithm (DBSA). DBSA does the scheduling for a source and their corresponding destination address for messages transmission and these scheduled addresses are passed through DBMON. Furthermore, the performance of DBMON is compared with the Crosstalk-Free Modified Omega Network (CFMON). CFMON also minimizes the crosstalk in a minimum number of passes. Results show that DBMON is better than CFMON in terms of the average number of passes and execution time. DBSA can transmit all the messages in only two passes from any source to any destination, through DBMON and without crosstalk. This network is the modified form of the original omega network. Crosstalk minimization is the main objective of the proposed algorithm and proposed network.