• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 1998.03a
• /
• pp.209-213
• /
• 1998

This study considers flowshop scheduling problem related to flexible maufacturing cell in which consists of two machining centers, robots for loading/unloading, and an automated guided vehicle(AGV) for material handling between two machining centers. Because no machinng center has buffer storage for work in process, a machining center can not release a finished job until the empty AGV is available at that machining center. While the AGV cannot tranfer an unfinished job to a machining center until the machining center empty. In this paper, an new heuristic algorithm is given to find the sequence that minimize their makespan.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.30 no.3
• /
• pp.94-102
• /
• 2007

In this paper, we consider a line balancing problem in hybrid flowshops where each workstation has identical parallel machines. The number of machines in each workstation is determined in ways of satisfying pre-specified throughput rate of the system. To minimize the total number of machines in the systems, we propose five heuristic methods and one simulated annealing method. Extensive computational experiments found the superiorities of two heuristic methods and the meta-heuristic.

• Journal of the Korea Society for Simulation
• /
• v.20 no.3
• /
• pp.1-10
• /
• 2011

In this study, we consider a capacity planning problem where the number of machines at each workstation is determined in manufacturing systems of top-edge electronic products such as semiconductor or display. The considered manufacturing system is the typical hybrid flowshop which has identical parallel machines at each workstation and the setup operation occurs when the types of consecutively processed products are different. The objective of the problem is finding good combinations of the numbers of machines at all workstations, under the given capital amount for purchasing machines. Various heuristic methods for determining the numbers of machines at workstations are proposed and the performances were tested through a series of computational experiments. In the study, a simulation model has been developed in order to simulate the considered manufacturing system with dynamic orders and complex process. The simulation model is also used for conducting the computational comparison test among various proposed methods.

• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.825-827
• /
• 1989

A heuristic model which determines the scheduling of serial flowshops with minimization of the makespan is proposed for an idealized batch chemical plant. It generates an initial sequence by heuristic reasoning and improves it recursively until no improvement is possible. The heuristic reasoning is based on Johnson's Rule which gives the sequence with the minimum makespan for a two-unit flowshop. The evolutionary step searches the neighborhood of the current sequence for sequences with lower makespan. The robustness of this model is also examined by comparing the minimum makespan of literature examples with the theoretical one.

• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10b
• /
• pp.1250-1255
• /
• 1990

This paper discusses an optimal cyclic scheduling problem for a FMC (Flexible Manufacturing Cell) modeled by a two-machine flowshop with two machining centers with APC's (Automated Pallet Changers), an AGV (Automated Guided Vehicle) and loading and unloading stations. Cyclic production in which similar patterns of production is repeated can significantly reduce the production lead-time and WIP (Work-In-Process) in such flexible, automated system. Thus we want to find an optimal cyclic schedule that minimizes the cycle time in each cycle. However, the existence of APC's as buffer storage for WIP makes the problem intractable (i.e., NP-complete). We propose an practical approximation algorithm that minimizes, instead of each cycle time, its upper bound. Performances of this algorithm are validated by the way of computer simulations.

• Journal of Korean Society for Quality Management
• /
• v.17 no.1
• /
• pp.35-47
• /
• 1989

This paper is concerned with a development and evaluation of heuristic algorithms for the n-job, M-stage flowshop with sequence dependent setup times. Three heuristic algorithms, CAIDAN, DANNEN and PETROV, are proposed. The makespan is taken as a performance measure for the algorithms. The experiment for each algorithm is designed for a $4{\times}3{\times}3$ factorial design with 360 observations. The experimental factors are PS (ratio of processing times to setup times), M (number of machines), and N (number of jobs). The makespan of the proposed heuristic algorithms is compared with the optimal makespan obtained by the complete enumeration method. The result of comparision of performance measure is called a relative error. The mean relative errors of CAIDAN, DANNEN and PETROV algorithms are 4.488%. 6.712% and 7.282%, respectively. The computational results are analysed using SPSS. The experimental results show that the three factors are statistically signiticant at 5% level.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.12 no.19
• /
• pp.39-47
• /
• 1989

This paper considers a multi-stage flowshop scheduling Problem where the setup times of jots depend on immediately preceding jobs. Three heuristics algorithms, CAMPBELL, PEIDAN and CAMRING are proposed. The performance measure is a minimization of makespan. The parameters of simulation model are PS(ratio of the processing times to setup times), M(number of machines), and N(number of job). This simulation model for each algorithm is a 4$\times$3$\times$3 factorial design with 360 observations. The makespan of the proposed heuristic algorithms is compared with the optimal makespan obtained by the complete enumeration of schedules. This yardstick of comparison is defined as a relative error. The mean relative error of CAMPBELL, PEIDAN, and CAMRING algorithms are 4.353%, 7.908%, and 8.578% respectively. The SPSS, is used to analyse emphirical results. The experimental results show that the three factors are statistically significant at 5% level.

• Journal of the Korea Society for Simulation
• /
• v.25 no.1
• /
• pp.45-52
• /
• 2016

In this study, we consider a capacity planning problem of reentrant hybrid flowshops. High-tech electronic products such as semiconductor or TFT-LCD, are produced from manufacturing systems which can be considered as reentrant hybrid flowshops. In the considered capacity planning problem, we determine the number of machines at each stage in the manufacturing system. We introduce criteria indicating which stage needs additional machines or which stage needs reduction of machines considering the characteristics of the product types and the manufacturing system. The objective function of the problem is maximizing throughput rate of the system, of which values are obtained from the simulation model depicting the hybrid flowshops. The performance of the proposed methods were evaluated through a series of computational experiments. The simulation model was also used for conducting the comparison experiments among the proposed method and benchmarks.