Journal of Korean Society of Industrial and Systems Engineering (산업경영시스템학회지)

Society of Korea Industrial and System Engineering (한국산업경영시스템학회)
권호 표지

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

부품 생산과 조립으로 구성된 2단계 조립 일정계획의 Flowtime 최소화 연구

  • Received : 2010.08.30
  • Accepted : 2010.12.01
  • Published : 2010.12.31
Download PDF
⟨ Previous Next ⟩

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

Acknowledgement

Supported by : 충주대학교

References

  1. 전재호; "부품외주를 고려한 Flowshop 일정계획문제연구", 산업경영시스템학회지, 29(4) : 34-42, 2006.
  2. 윤상흠, 전재호; "부품외주를 고려한 Flowshop 일정계획해법 개선", 산업경영시스템학회지, 31(2) : 80-93, 2008.
  3. Baker, K. R.; Introduction to Sequencing and Scheduling, John Wiley and Sons, 1974.
  4. 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. https://doi.org/10.1006/jagm.1993.1002
  5. Garey, M. R. and Johnson, D. S.; Computers and Intractability- A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
  6. 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. https://doi.org/10.1016/S0167-5060(08)70356-X
  7. 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. https://doi.org/10.1016/S0377-2217(96)00312-8
  8. Koulamas, C. and Kyparisis, G. J.; "The three-stage assembly flowshop scheduling problem," Computers and Operations Research, 28 : 689-704, 2001. https://doi.org/10.1016/S0305-0548(00)00004-6
  9. 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. https://doi.org/10.1016/S0377-2217(03)00250-9
  10. 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. https://doi.org/10.1287/mnsc.39.5.616
  11. 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.
  12. Pinedo, M.; Scheduling Theory, Algorithms, and Systems, Prentice-Hall, New Jersey, 2002.
  13. 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. https://doi.org/10.1287/opre.43.2.346
  14. 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. https://doi.org/10.1016/S0377-2217(02)00245-X
  15. 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. https://doi.org/10.1016/j.ijpe.2009.03.012
  16. Taha, A. H.; Operations Research-An Introduction, Prentice Hall, New Jersey, 1997.
  17. 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. https://doi.org/10.1016/S0305-0548(01)00098-3