• Journal of the Korean Operations Research and Management Science Society
• /
• v.33 no.3
• /
• pp.1-16
• /
• 2008

This paper considers a scheduling problem to minimize the total tardiness in the two-stage assembly-type flowshop. The system is composed of multiple fabrication machines in the first stage and a final-assembly machine in the second stage. Each job consists of multiple tasks, each task is performed on the fabrication machine specified in advance. After all the tasks of a job are finished, the assembly task can be started on the final-assembly machine. The completion time of a job is the time that the assembly task for the job is completed. The objective of this paper is to find the optimal schedule minimizing the total tardiness of a group of jobs. In the problem analysis, we first derive three solution properties to determine the sequence between two consecutive jobs. Moreover, two lower objective bounds are derived and tested along with the derived properties within a branch-and-bound scheme. Two efficient heuristic algorithms are also developed. The overall performances of the proposed properties, branch-and-bound and heuristic algorithms are evaluated through numerical experiments.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.27 no.2
• /
• pp.24-28
• /
• 2004

This paper considers a scheduling problem concerned with an assembly system where two components are first treated In their own parallel machines and then pulled to be assembled into a final product at a single assembly machine. The objective measure is the mean completion time of jobs(a finite number of products). Through characterizing solution properties, we obtain the worst case error bounds of an arbitrary permutation and a SPT based heuristic.

• Journal of the Korea Safety Management & Science
• /
• v.12 no.3
• /
• pp.215-221
• /
• 2010

Many researches and projects are actively implemented in the academic world and industrial world in order to increase the productivity through changing utility layout. Effective layout makes the flow of parts and products go on wheels and helps labor forces and utilities to be used efficiently. In this study, we looked at effect on utility layout change through a case of a company making a fuel tank of vehicle in Korea. Due to the layout improvement, this company could have flowshop system on welding line, so the stock in line was decreased, checking the number of stock became easier than before and it was possible to evaluate exact cycle time per unit. Through not only confirming qualitative effect, but also checking quantitative effect such as UPH(Unit per Hour), we obtained the conclusion that the layout improvement increased the productivity.

• Journal of Korean Institute of Industrial Engineers
• /
• v.33 no.2
• /
• pp.254-264
• /
• 2007

This paper considers a scheduling problem to minimize the total weighted completion time in the two-stage assembly-type flowshop. The system is composed of multiple fabrication machines in the first stage and a final-assembly machine in the second stage. Each job consists of multiple components, each component is machined on the fabrication machine specified in advance. The manufactured components of each job are subsequently assembled into a final product on the final-assembly machine. The objective of this paper is to find the optimal schedule minimizing the total weighted completion time of jobs. Three lower bounds are derived and tested in a branch-and-bound (B&B) Procedure. Also, three heuristic algorithms are developed based on the greedy strategies. Computational results show that the proposed B&B procedure is more efficient than the previous work which has considered the same problem as this paper.

• 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 Korean Society of Industrial and Systems Engineering
• /
• v.13 no.21
• /
• pp.91-100
• /
• 1990

This paper is concerned with the development of optimal algorithms for multi-stage flowshop scheduling problems with sequence dependent setup times. In the previous researches the setup time of a job is considered to be able to begin at the earliest opportunity given a particular sequence at the start of operations. In this paper the setup time of a job is considered to be able to begin only at the completion of that job on the previous machine to reflect the effects of the setup time to the performance measure of sequence dependent setup time flowshop scheduling. The results of the study consist of two areas; first, a general integer programming(IP) model is formulated and a nixed integer linear programming(MILP) model is also formulated by introducing a new binary variable. Second a depth-first branch and bound algorithm is developed. To reduce the computational burdens we use the best heuristic schedule developed by Choi(1989) as the first trial. The experiments for developed algorithm are designed for a 4$\times$3$\times$3 factorial design with 360 observations. The experimental factors are PS(ratio of processing time to setup time), M(number of machines), N(number of jobs).

• 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.

• 제어로봇시스템학회:학술대회논문집
• /
• 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 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.