Journal of Korean Institute of Industrial Engineers (대한산업공학회지)

Korean Institute of Industrial Engineers (대한산업공학회)
권호 표지

Heuristic Algorithm for the Single-machine Scheduling with Periodic Maintenance

주기정비를 고려한 단일기계 일정계획을 위한 휴리스틱 알고리즘 설계

  • Lee, Sang-Heon (Department of Operations Research, Korea National Defense University) ;
  • Lee, In-Gu (Studies and Analyses Wing, ROK Air Force Hq)
  • Received : 2008.01.21
  • Accepted : 2008.03.30
  • Published : 2008.09.30
Download PDF
⟨ Previous Next ⟩

Abstract

This paper considers a single-machine scheduling problem with availability constraints. In many realistic situations, machines may not be always available due to various reasons such as maintenance, breakdown and repair. However, most literature on scheduling assume that the machines are available at all times. This paper deals with a single-machine scheduling problem with periodic maintenance. If the maintenance decision is made jointly with the job scheduling, the system will be more effective. The objective is to minimize the total completion time of jobs. This problem is proved to be NP-hard in the strong sense. The proposed breaking heuristic(BH) algorithm rule is established by some theorems and conditions. Our computational results show that the BH algorithm is much more efficient than existing heuristic.

Keywords

References

  1. Akturk, M. S., Ghosh, J. B., and Gunes, E. D. (2003), Scheduling with Tool Changes to Minimize Total Completion Time : A Study of Heuristics and Their Performance, Naval Research Logistics, 50, 15-30 https://doi.org/10.1002/nav.10045
  2. Akturk, M. S., Ghosh, J. B., and Gunes, E. D. (2004), Scheduling with Tool Changes to Minimize Total Completion Time : Basic Results and SPT Performance, European Journal of Operational Research, 157, 784-790 https://doi.org/10.1016/S0377-2217(03)00232-7
  3. Chen, J. S. (2006a), Single-machine Scheduling with Flexible and Periodic Maintenance, Journal of Operational Research Society, 57, 703-710 https://doi.org/10.1057/palgrave.jors.2602043
  4. Chen, W. J. (2006b), Minimizing Total Flow Time in the Single-machine Scheduling Problem with Periodic Maintenance, Journal of Operational Research Society, 57, 410-415 https://doi.org/10.1057/palgrave.jors.2601998
  5. Graves, G. H. and Lee, C. Y. (1999), Scheduling Maintenance and Semi-resumable Jobs on a Single Machine, Naval Research Logistics, 46, 845-863 https://doi.org/10.1002/(SICI)1520-6750(199910)46:7<845::AID-NAV6>3.0.CO;2-#
  6. Ji, Min, He, Yong, and Cheng, T. C. E. (2007), Single-machine Scheduling with Periodic Maintenance to Minimize Makespan, Computers and Operations Research, 34, 1764-1770 https://doi.org/10.1016/j.cor.2005.05.034
  7. Kacem, I., Chu, C., and Souissi, A. (2008), Single-machine Scheduling with an Availability Constraint to Minimize the Weighted Sum of the Completion Times, Computers and Operations Research, 35, 827-844 https://doi.org/10.1016/j.cor.2006.04.010
  8. Lee, C. Y. (1996), Machine Scheduling with Availability Constraint, Journal of Global Optimization, 9, 395-416 https://doi.org/10.1007/BF00121681
  9. Lee, C. Y., Lei, L. and Pinedo, M. (1997), Current Trend in Deterministic Scheduling, Annals of Operations Research, 70, 1-41 https://doi.org/10.1023/A:1018909801944
  10. Lee, C. Y. and Leon, L. (2001), Machine Scheduling with a Rate-modifying Activity, European Journal of Operational Research, 128, 119-128 https://doi.org/10.1016/S0377-2217(99)00066-1
  11. Lee, C. Y. and Liman, S. D. (1992), Single-Machine Flow-time Scheduling with Scheduled Maintenance, Acta Inform, 29, 375-382 https://doi.org/10.1007/BF01178778
  12. Lee, C. Y. and Lin, C. S. (2001), Single-Machine Scheduling with Maintenance and Repair Rate-modifying Activity, European Journal of Operational Research , 135, 493-513 https://doi.org/10.1016/S0377-2217(00)00322-2
  13. Leon, C. J. and Wu, S. D (1992), On Scheduling with Ready-times, Duedates and Vacations, Naval Research Logistics, 39, 53-65 https://doi.org/10.1002/1520-6750(199202)39:1<53::AID-NAV3220390105>3.0.CO;2-C
  14. Leung, Joseph Y-T. (2004), Handbook of Scheduling, Chapman and Hall/CRC
  15. Liao, C. J. and Chen, W. J (2003), Single-machine Scheduling with Periodic Maintenance and Nonresumable Jobs, Computers and Operations Research, 30, 1335-1347 https://doi.org/10.1016/S0305-0548(02)00074-6
  16. Qi, X., Chen, T. and Tu, F. (1999), Scheduling the Maintenance on a Single Machine, Journal of Operational Research Society, 50, 1071-1078 https://doi.org/10.2307/3009932
  17. Sadfi, Cherif, Penz, Bernard, Rapine, Christophe, Blazewicz, Jacek and Formanowicz, Piotr. (2005), An Improved Approximation Algorithm for the Single Machine Total Completion Time Scheduling Problem with Availability Constraints, European Journal of Operational Research, 161, 3-10 https://doi.org/10.1016/j.ejor.2003.08.026
  18. Sanlaville, E. and Schimdt, G. (1998), Machine Scheduling with Availability Constraints, Acta Inform, 35, 795-811 https://doi.org/10.1007/s002360050143
  19. Schmidt, Günter (2000), Scheduling with Limited Machine Availability, European Journal of Operational Research, 121, 1-15 https://doi.org/10.1016/S0377-2217(98)00367-1
  20. Yang, D. L., Hung, C. L., Hsu, C. J. and Chern, M. S. (2002), Minimizing the Makespan in a Single Machine Scheduling Problem with a Flexible Maintenance, Journal of the Chinese Institute of Industrial Engineers, 19, 63-66 https://doi.org/10.1080/10170660209509183