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

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

An Improvement of Algorithms for Assembly-type Flowshop Scheduling Problem with Outsourcing

부품외주를 고려한 조립형 Flowshop 일정계획 해법 개선

  • Yoon, Sang-Hum (School of Management, Yeungnam University) ;
  • Juhn, Jae-Ho (Division of Public Management Information System, Chungju National University)
  • 윤상흠 (영남대학교 경영학부) ;
  • 전재호 (충주대학교 행정학부 행정정보시스템학)
  • Published : 2008.06.30
Download PDF
⟨ Previous Next ⟩

Abstract

This paper improves algorithms for an assembly-type flowshop scheduling problem in which each job is to assemble two types of components and makespan is the objective measure. For the assembly, one type of the components is outsourced with job-dependent lead time but the other type is fabricated in-house. When both components for a job are prepared, the assembly operation for the job can be started. This problem had been proved to be NP-Complete, so branch-and-bound (B&B) and heuristic algorithms have already been developed. In this paper, we suggest other dominance rules, lowerbound and heutistic algorithms. Also, we develop a new B&B algorithm using these improved bound and dominance rules. The suggested heuristics and B&B algorithm are compared with existing algorithms on randomly-generated test problems.

Keywords

References

  1. 전재호; "부품외주를 고려한 조립형 Flowshop 일정계획 문제 연구", 산업경영시스템학회지, 29(4):34-42, 2006
  2. Bertrand, J. W. M. and Muntslag, D. R.; "Production control in engineer-to-order firms," International Journal of Production Economics, 30-31:3-22, 1993 https://doi.org/10.1016/0925-5273(93)90077-X
  3. Chen, Z. -L., Hall, N. G.; "Supply Chain Scheduling: Conflict and Cooperation in Assembly Systems," Operations Research, 55(6):1072-1089, 2007 https://doi.org/10.1287/opre.1070.0412
  4. 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
  5. Johnson, S. M.; "Optimal two- and three-stage production schedules with setup times included," Naval Research Logistics Quarterly, 1:61-68, 1954 https://doi.org/10.1002/nav.3800010110
  6. Juhn, J., Sung, C. S., and Yoon, S. H.; "Analysis of heuristics for a two-stage assembly scheduling problem with component available time constraint," Submitted to Operations Research Letters for publication, 2006
  7. Koulamas, C., and Kyparisis, G. J.; "The three-stage assembly flowshop scheduling problem," Computers & Operations Research, 28:689-704, 2001 https://doi.org/10.1016/S0305-0548(00)00004-6
  8. 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
  9. 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
  10. 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 https://doi.org/10.1016/j.omega.2005.04.004
  11. 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
  12. 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
  13. 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 & Operations Research, 30:309-320, 2003 https://doi.org/10.1016/S0305-0548(01)00098-3