Browse > Article

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)
Publication Information
Journal of Korean Institute of Industrial Engineers / v.34, no.3, 2008 , pp. 318-327 More about this Journal
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
Scheduling; Availability Constraint; Maintenance; Total Completion Time; Breaking Heuristic;
Citations & Related Records
연도 인용수 순위
  • Reference
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   DOI   ScienceOn
2 Lee, C. Y. (1996), Machine Scheduling with Availability Constraint, Journal of Global Optimization, 9, 395-416   DOI
3 Lee, C. Y. and Liman, S. D. (1992), Single-Machine Flow-time Scheduling with Scheduled Maintenance, Acta Inform, 29, 375-382   DOI
4 Schmidt, Günter (2000), Scheduling with Limited Machine Availability, European Journal of Operational Research, 121, 1-15   DOI   ScienceOn
5 Chen, J. S. (2006a), Single-machine Scheduling with Flexible and Periodic Maintenance, Journal of Operational Research Society, 57, 703-710   DOI   ScienceOn
6 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   DOI   ScienceOn
7 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   DOI   ScienceOn
8 Liao, C. J. and Chen, W. J (2003), Single-machine Scheduling with Periodic Maintenance and Nonresumable Jobs, Computers and Operations Research, 30, 1335-1347   DOI   ScienceOn
9 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   DOI   ScienceOn
10 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   DOI   ScienceOn
11 Qi, X., Chen, T. and Tu, F. (1999), Scheduling the Maintenance on a Single Machine, Journal of Operational Research Society, 50, 1071-1078   DOI
12 Leung, Joseph Y-T. (2004), Handbook of Scheduling, Chapman and Hall/CRC
13 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   DOI   ScienceOn
14 Graves, G. H. and Lee, C. Y. (1999), Scheduling Maintenance and Semi-resumable Jobs on a Single Machine, Naval Research Logistics, 46, 845-863   DOI   ScienceOn
15 Lee, C. Y., Lei, L. and Pinedo, M. (1997), Current Trend in Deterministic Scheduling, Annals of Operations Research, 70, 1-41   DOI
16 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   DOI   ScienceOn
17 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   DOI   ScienceOn
18 Leon, C. J. and Wu, S. D (1992), On Scheduling with Ready-times, Duedates and Vacations, Naval Research Logistics, 39, 53-65   DOI
19 Lee, C. Y. and Leon, L. (2001), Machine Scheduling with a Rate-modifying Activity, European Journal of Operational Research, 128, 119-128   DOI   ScienceOn
20 Sanlaville, E. and Schimdt, G. (1998), Machine Scheduling with Availability Constraints, Acta Inform, 35, 795-811   DOI