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

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

A Scheduling Problem in Fork-and-Join System

Fork-and-Join 시스템에서의 일정계획 문제

  • Published : 2009.09.30
Download PDF
⟨ Previous Next ⟩

Abstract

본 논문은 조립과 분리시스템이 혼합된 Fork-and-Join 시스템에서의 일정계획문제를 고려하고 있다. 최초 단계에서는 구성품단위로 분리가 발생하고 두 번째 단계에서는 부품생산단계에서 각 부품 또는 구성품이 서로 다른 설비와 경로를 통해 독립적으로 생산된 후 최종 조립단계로 이동하게 되고, 그곳에서 조립공정을 통해 제품으로 완성된다. 본 논문에서는 이러한 Fork-and-Join 시스템에서 최종완료시간(makespan)을 최소화 할 수 있는 발견적 해법을 제안하고 이 해법의 최악오차한계(worst-case error bound)가 2라는 것을 증명한다. 또한, 제안된 문제의 효과적인 3가지 하한값(lower bound)을 제시하고 다양한 수치실험을 통해 제안된 발견적 해법의 결과와 하한값과의 비교를 통해 제안된 해법이 성능이 우수함을 증명한다.

Keywords

References

  1. Duda, A. and Czachorski, T.; "Performance Evaluation of Fork and Join Synchronization Primitives," Acta Informatica, 24 : 525-553, 1987
  2. Garey, M. R. and Johnson D. S.; Computers and Intractability : A Guide to the Theory of NP-completeness, Freeman, 1979
  3. Gershwin, S. B.; Manufacturing Systems Engineering, Prentice-Hall, 1994
  4. Gungor, A. and Gupta, S. M.; "Disassembly Sequence Planning for Products with Defective Parts in Product Recovery," Computers and Industrial Engineering, 35 : 161-164, 1998 https://doi.org/10.1016/S0360-8352(98)00047-3
  5. 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, 1987 https://doi.org/10.1016/S0377-2217(96)00312-8
  6. Heidelberger, P. and Trivedi K. S.; "Analytic Queueing Models for Programs with Internal Concurrency," IEEE Transactions on Computers, 32 : 73-98, 1983 https://doi.org/10.1109/TC.1983.1676125
  7. Hodgson, T. J. and McDonald, G. W.; "Interactive Scheduling of a Generalized Flow Shop. Part 1 : Success through Evolutionary Development," Interfaces, 11 : 42-47, 1981 https://doi.org/10.1287/inte.11.2.42
  8. 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
  9. 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
  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, 3 : 616-625, 1993 https://doi.org/10.1287/mnsc.39.5.616
  11. O'Shea, B., Grewal S. S., and Kaebernick, H.; "State of the Art Literature Survey on Disassembly Planning," Concurrent Engineering : Research and Applications, 6 : 345-357, 1998 https://doi.org/10.1177/1063293X9800600407
  12. 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
  13. 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 : 499-517, 2003 https://doi.org/10.1016/S0377-2217(02)00245-X
  14. Yoon, S. H., Lee I. S., and Sung, C. S.; "A Note on the Reversibility of the Two Stage Assembly Scheduling Problem," International Journal of Management Science, 13 : 25-34, 2007