한국경영과학회지 (Journal of the Korean Operations Research and Management Science Society)

  • 제30권1호
  • /
  • Pages.27-41
  • /
  • 2005
  • /
  • 1225-1119(pISSN)
  • /
  • 2733-4759(eISSN)
한국경영과학회 (The Korean Operations Research and Management Science Society)
권호 표지

패밀리 셋업이 존재하는 병렬기계 일정계획 수립

Scheduling for Parallel Machines with Family Setup Times

  • 발행 : 2005.03.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

This paper considers identical parallel machine scheduling problem. Each job has a processing time. due date. weight and family type. If a different type of job is followed by prior job. a family setup is incurred. A two phased heuristic is presented for minimizing the sum of weighted tardiness. In the first phase. using roiling horizon technique. group each job into same family and schedule each family. In the second phase. assign each job to machines using schedule obtained in the first phase. Extensive computational experiments and comparisons among other algorithms are carried out to show the efficiency of the proposed algorithm.

키워드

참고문헌

  1. Azizoglu, M and S. Webster, 'Scheduling Parallel Machines to Minimize Weighted Flowtime with Family Set-up Times,' International Journal of Production Research, VoI.41, No.6 (2003), pp.1199-1215 https://doi.org/10.1080/0020754021000042959
  2. Barnes, J.W. and J.W. Brennan, 'An Improved Algorithm for Scheduling Jobs on Identical Machines,' lIE Transactions, Vol.9, No.1(1977), pp.25-31
  3. Bitran, GR and S.M. Gilbert, 'Sequencing Production on Parallel Machines with Two Magnitudes of Sequence-Dependent Setup Cost,' Journal of Manufacturing and Operations Management, Vol.3(1990), pp.190-200
  4. Cheng, T.C.E. and C.C.S. Sin, 'A State-of-the-Art Review of Parallel-Machine Scheduling Research,' European Journal of Operational Research. Vol.47, No.3(1990), pp.271-292 https://doi.org/10.1016/0377-2217(90)90215-W
  5. Dogramaci, A, 'Production Scheduling of Independent Jobs on Parallel Identical Processors,' International Journal of Production Research, Vol.22, No.4(1984), pp.535-548 https://doi.org/10.1080/00207548408942477
  6. Elmagraby, S.E. and S. Park, 'Scheduling Jobs on a Number of Identical Machines,' lIE Transactions, Vol.6, No. 1(1974) , pp.1-13
  7. Glover, F., 'Tabu Search - Part I,' ORSA Journal on Computing, Vol.1, No.3(1989), pp. 190-206 https://doi.org/10.1287/ijoc.1.3.190
  8. Glover, F., 'Tabu search - Part II,' ORSA Journal on Computing, Vol.2, No.1(1990), pp. 4-32 https://doi.org/10.1287/ijoc.2.1.4
  9. Glover, F. and M. Laguna, Tabu Search, Kluwer Academic Publishers, Dordrecht, 1997
  10. Hariri, AMA and C.N. Potts, 'Heuristics for Scheduling Unrelated Parallel Machines,' Computers & Operations Research, Vol.18, No.3(1991) pp.323-331 https://doi.org/10.1016/0305-0548(91)90034-O
  11. Horowitz, E. and S. Sahni, 'Exact and Approximate Algorithms for Scheduling Nonidentical Processors,' Journal of ACM, Vol.23 (1976), pp.317-327 https://doi.org/10.1145/321941.321951
  12. Karp, R.M, Reducibility among Combinatorial Problems - Complexity of Computer Computations, Plenum Press, New York, 1972
  13. Laguna, M., J. W. Barnes and F. Glover, 'Tabu Search Methods for Single Machine Scheduling Problem,' Journal of Intelligent Manufacturing, Vol.2, No.1(1991) , pp.63-74 https://doi.org/10.1007/BF01471219
  14. Lawler, E.L., J.K Lenstra, AHG. Rinnooy Kan and DB. Shmoys, Sequencing and Scheduling : Algorithms and Complexity, Handbooks in Operations and Management Science, Vol.4, 1993
  15. Lee, Y.H. and M Pinedo, 'Scheduling Jobs on Parallel Machines with Sequence-Dependent Setup Times,' European Journal of Operational Research, Vol.100, No.3(1997), pp.464-474 https://doi.org/10.1016/S0377-2217(95)00376-2
  16. Monma, C.L. and C.N. Potts, 'Analysis of Heuristic for Preemptive Parallel Machine Scheduling with Batch Setup Times,' Operations Research, Vol.41, No.5(1993), pp.981-993 https://doi.org/10.1287/opre.41.5.981
  17. Ovacik, I.M and R. Uzsoy, 'Rolling Horizon Procedures for Dynamic Parallel Machine Scheduling with Sequence-Dependent Setup Times,' International Journal of Production Research, Vol.33, No.1(1995), pp.3173-3192 https://doi.org/10.1080/00207549508904867
  18. Ovacik, I.M. and R. Uzsoy, Decem- position Methods for Complex Factory Scheduling Problems, Kluwer Academic Publishers, 1997
  19. Pinedo, M., Scheduling : Theory, Algorithms, and System, Prentice Hall, New Jersey, 1995
  20. Schutten, J.M.J. and R.A.M. Leussink, 'Parallel Machine Scheduling with Release Dates, Due Dates and Family Setup Times,' International Journal of Production Economics, Vol.46/47(1996), pp.119-125 https://doi.org/10.1016/0925-5273(95)00086-0
  21. Tang, C.S., 'Scheduling Batches on Parallel Machines with Major and Minor Set-ups,' European Journal of Operational Research, Vol.46, No.1(1990), pp.28-37 https://doi.org/10.1016/0377-2217(90)90295-M
  22. Vasilescu, E.N. and AD. Amar, 'An Empirical Evaluation of the Entrapment Procedure for Scheduling Jobs on Identical Machines,' lIE Transactions, Vol.15(1983), pp.261-263
  23. Vollmann, T.E, .L.B. Berry, D.C. Whybark and F.R. Jacobs, Manufacturing Planning and Control for Supply Chain Management, McGraw-Hill, 2004