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

  • 제29권4호
  • /
  • Pages.34-42
  • /
  • 2006
  • /
  • 2005-0461(pISSN)
  • /
  • 2287-7975(eISSN)
한국산업경영시스템학회 (Society of Korea Industrial and System Engineering)
권호 표지

부품외주를 고려한 조립형 Flowshop 일정계획문제 연구

An Assembly-Type Flowshop Scheduling Problem with Outsourcing Allowed

  • 전재호 (충주대학교 행정학부 행정정보시스템학)
  • Juhn, Jae-Ho (Division of Public Management Information System, Chungju National University)
  • 발행 : 2006.12.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

This paper considers an assembly-type flowshop scheduling problem in which each job is assembled with two types of components. One type of the components is outsourced with positive lead time but the other type is fabricated in-house at the first stage. The two types of the components should be prepared at the first stage before starting the assembly operation for each job at the second stage. The objective is to schedule the jobs so that the makespan is minimized. Some solution properties and lower bounds are derived and incorporated into a branch and bound algorithm. Also, an efficient heuristic is developed. The performances of the proposed branch and bound algorithm and heuristic are evaluated through computational experiments.

키워드

참고문헌

  1. 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
  2. Garey, M. R. and Johnson, D. S.; Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Company, San Francisco, 1979
  3. 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
  4. 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
  5. 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
  6. 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
  7. 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
  8. 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
  9. 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
  10. 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
  11. 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