Browse > Article

Heuristic Algorithms for Minimizing Flowtime in the 2-Stage Assembly Flowshop Scheduling  

Lee, Ik-Sun (Department of Business Administration, Dong-A University)
Yoon, Sang-Hum (School of Business, Yeungnam University)
Ha, Gui-Ryong (POSTECH)
Juhn, Jae-Ho (Department of Public Management Information System, Chungju National University)
Publication Information
Journal of Korean Society of Industrial and Systems Engineering / v.33, no.4, 2010 , pp. 45-57 More about this Journal
Abstract
This paper considers a 2-stage assembly flowshop scheduling problem where each job is completed by assembling multiple components. The problem has the objective measure of minimizing total completion time. The problem is shown to be NP-complete in the strong sense. Thus, we derive some solution properties and propose three heuristic algorithms. Also, a mixed-integer programming model is developed and used to generate a lower bound for evaluating the performance of proposed heuristics. Numerical experiments demonstrate that the proposed heuristics are superior over those of previous research.
Keywords
Assembly-type Flowshop; Flowtime; Heuristic Algorithm;
Citations & Related Records
Times Cited By KSCI : 2  (Citation Analysis)
연도 인용수 순위
1 Kovalyov, M. Y., Potts, C. N., and Strusevich, V. A.; "Batching decisions for assembly production systems," European Journal of Operational Research, 157 : 620-642, 2004.   DOI   ScienceOn
2 윤상흠, 전재호; "부품외주를 고려한 Flowshop 일정계획해법 개선", 산업경영시스템학회지, 31(2) : 80-93, 2008.   과학기술학회마을
3 Sun, X., Morizawa, K., and Nagasawa, H.; "Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling," European Journal of Operational Research, 146 : 498-516, 2003.   DOI   ScienceOn
4 Sung, C. S. and Juhn, J.; "Makespan minimization for a 2-stage assembly scheduling subject to component available time constraint," International Journal of Production Economics, 119 : 392-401, 2009.   DOI   ScienceOn
5 Taha, A. H.; Operations Research-An Introduction, Prentice Hall, New Jersey, 1997.
6 Tozkapan, A., Kirca, O., and Chung, C. S.; "A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem," Computers and Operations Research, 30 : 309-320, 2003.   DOI   ScienceOn
7 Lin, B. M. T., Cheng, T. C. E., and Chou, A. S. C.; "Scheduling in an assembly-type production chain with batch transfer," OMEGA : The International Journal of Management Science, 35(2) : 143-151, 2007.
8 Potts, C. N., Sevast'janov, S. V., Strusevich, V. A., Wassenhove, L. N. V., and Zwaneveld, C. M.; "The two-stage assembly scheduling problem : Complexity and approximation," Operations Research, 43 : 346-355, 1995.   DOI   ScienceOn
9 Baker, K. R.; Introduction to Sequencing and Scheduling, John Wiley and Sons, 1974.
10 Pinedo, M.; Scheduling Theory, Algorithms, and Systems, Prentice-Hall, New Jersey, 2002.
11 Koulamas, C. and Kyparisis, G. J.; "The three-stage assembly flowshop scheduling problem," Computers and Operations Research, 28 : 689-704, 2001.   DOI   ScienceOn
12 전재호; "부품외주를 고려한 Flowshop 일정계획문제연구", 산업경영시스템학회지, 29(4) : 34-42, 2006.   과학기술학회마을
13 Du, J. and Leung, J. Y. T.; "Minimizing mean flow time in two-machine open shops and flow shops," Journal of Algorithms, 14(1) : 24-44, 1993.   DOI   ScienceOn
14 Garey, M. R. and Johnson, D. S.; Computers and Intractability- A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
15 Graham, R. L., Johnson, E. L., Lenstra, J. K., and Rinnooy Kan, A. H. G.; "Optimization and approximation in deterministic sequencing and scheduling : A survey," Annals of Discrete Mathematics, 5 : 287-326, 1979.   DOI
16 Hariri, A. M. A. and Potts, C. N.; "A branch and bound algorithm for the two-stage assembly scheduling problem," European Journal of Operational Research, 103 : 547-556, 1997.   DOI   ScienceOn
17 Lee, C. Y., Cheng, T. C. E., and Lin, B. M. T.; "Minimizing the makespan in the 3-machine assembly -type flowshop scheduling problem," Management Science, 39 : 616-625, 1993.   DOI   ScienceOn