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

  • 제30권2호
  • /
  • Pages.44-50
  • /
  • 2007
  • /
  • 2005-0461(pISSN)
  • /
  • 2287-7975(eISSN)
한국산업경영시스템학회 (Society of Korea Industrial and System Engineering)
권호 표지

Rate-Modifying 활동이 있는 병렬기계의 Makespan 최소화를 위한 일정 계획

Parallel Machines Scheduling with Rate-Modifying Activities to Minimize Makespan

  • Cho, Hang-Min (Department of Industrial Engineering, Hanyang University) ;
  • Yim, Seung-Bin (Department of Industrial Engineering, Hanyang University) ;
  • Jeong, In-Jae (Department of Industrial Engineering, Hanyang University)
  • 발행 : 2007.06.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

This paper deals with the problem of scheduling jobs and rate-modifying activities on parallel machines. A rate-modifying activity is an activity that changes the production rate of equipment such as maintenance and readjustment. If a job is scheduled after the rate-modifying activity, then the processing time varies depending on the modifying rate of the activity. In this study, we extend the single machine problem to parallel machines problem and propose algorithms is to schedule the rate-modifying activities and jobs to minimize the makespan on parallel machines which is NP-hard. We propose a branch and bound algorithm with three lower bounds to solve medium size problems optimally. Also we develop three heuristics, Modified Longest Processing Time, Modified MULTIFIT and Modified COMBINE algorithms to solve large size problems. The test results show that branch and bound algorithm finds the optimal solution in a reasonable time for medium size problems (up to 15 jobs and 5 machines). For large size problem, Modified COMBINE and Modified MULTIFIT algorithms outperform Modified LPT algorithm in terms of solution quality.

키워드

참고문헌

  1. Baker, K. R.; Introduction to Sequencing and Scheduling, 1943-, John Wiley & Sons Inc, 1974
  2. Coffman Jr., E. G. and, Garey, M. R. and Johnson, D. S.; 'An Application of Bin-Packing to Multiprocessor Scheduling,' SIAM Journal on Computing, 7(1) : 1-17, 1978 https://doi.org/10.1137/0207001
  3. Ethel Mokotoff; 'An Exact Algorithm for the Identical Parallel Machine Scheduling Problem,' European Journal of Operation Research, 152 : 758-769, 2004 https://doi.org/10.1016/S0377-2217(02)00726-9
  4. Graham, R. L.; 'Bounds on Multiprocessing Timing Anomalies,' SIAM Journal on Applied mathematics, 17(2) : 416-429, 1969 https://doi.org/10.1137/0117039
  5. Graves, G. H. and Lee, C.-Y.; 'Scheduling Maintenance and Semi-resumable Jobs on a Single Machine,' Naval Research Logistics, 46 : 845-863, 1999 https://doi.org/10.1002/(SICI)1520-6750(199910)46:7<845::AID-NAV6>3.0.CO;2-#
  6. Ho, J. C. and Wong J. S.; 'Makespan Minimization for m Parallel Identical Processors,' Naval Research Logistics, 42 : 935-948, 1995 https://doi.org/10.1002/1520-6750(199509)42:6<935::AID-NAV3220420606>3.0.CO;2-D
  7. Lee, C. Y. and Lin, C. S.; 'Single-Machine Scheduling with maintenance and repair rate-modifying activities,' European Journal of Operation Research, 135 : 493-513, 2001 https://doi.org/10.1016/S0377-2217(00)00322-2
  8. Lee, C.-Y. and Chen, Z. L.; 'Scheduling of Jobs and Maintenance Activities on Parallel Machines,' Naval Research Logistics, 47 : 145-165, 2000 https://doi.org/10.1002/(SICI)1520-6750(200003)47:2<145::AID-NAV5>3.0.CO;2-3
  9. Lee, C.- Y. and Leon, V. J.; 'Machine Scheduling with a Rate-Modifying Activity,' European Journal of Operation Research, 128 : 119-128, 2001 https://doi.org/10.1016/S0377-2217(99)00066-1
  10. Lee, C.-Y. and Massey, J. D.; 'Multiprocessor scheduling: Combining LPT and MULTIFIT,' Discrete Applied mathematics, 20 : 233-242, 1988 https://doi.org/10.1016/0166-218X(88)90079-0
  11. Liao, C. J. and Shyur, D. L., and Lin, C. H.; 'Makespan Minimization for Two Parallel Machines with an Availability Constraint,' European Journal of Operation Research, 160 : 445-456, 2005 https://doi.org/10.1016/j.ejor.2003.08.034
  12. Pinedo, M.; Scheduling: Theory, Algorithms, and Systems, 2nd Edition, Prentice-Hall, Englewood Cliffs, NJ, 2002