Planning Machine Maintenance in Two-Machine Shop Scheduling

We consider the two-machine open shop and two-machine flow shop scheduling problems in which each machine has to be maintained exactly once during the planning period, and the duration of each of these intervals depends on its start time. The objective is to minimize the maximum completion time of all activities to be scheduled. We resolve complexity and approximability issues of these problems. The open shop problem is shown to be polynomially solvable for quite general functions defining the length of the maintenance intervals. By contrast, the flow shop problem is proved binary NP-hard and pseudopolynomially solvable by dynamic programming. We also present a fully polynomial approximation scheme and a fast 3/2-approximation algorithm.

[1]  C. T. Ng,et al.  An FPTAS for scheduling a two‐machine flowshop with one unavailability interval , 2004 .

[2]  George L. Nemhauser,et al.  Handbooks in operations research and management science , 1989 .

[3]  Randeep Bhatia,et al.  Minimizing service and operation costs of periodic scheduling , 2002, SODA '98.

[4]  Chung-Yee Lee.  Two-machine flowshop scheduling with availability constraints , 1999, Eur. J. Oper. Res..

[5]  Chung-Yee Lee,et al.  Machine Scheduling with Availability Constraints , 2004, Handbook of Scheduling.

[6]  Chung Yee Lee,et al.  Scheduling maintenance and semiresumable jobs on a single machine , 1999 .

[7]  Doc Palmer,et al.  Maintenance Planning and Scheduling Handbook , 1999 .

[8]  Bertrand M. T. Lin,et al.  A concise survey of scheduling with time-dependent processing times , 2004, Eur. J. Oper. Res..

[9]  David M. Miller,et al.  Maximizing the Effectiveness of a Preventive Maintenance System: An Adaptive Modeling Approach , 1997 .

[10]  Alessandro Agnetis,et al.  Scheduling Problems with Two Competing Agents , 2004, Oper. Res..

[11]  Xiangtong Qi,et al.  Scheduling the maintenance on a single machine , 1999, J. Oper. Res. Soc..

[12]  Eugene L. Lawler,et al.  Sequencing and scheduling: algorithms and complexity , 1989 .

[13]  Günter Schmidt,et al.  Scheduling with limited machine availability , 2000, Eur. J. Oper. Res..

[14]  Vitaly A. Strusevich,et al.  Polynomial‐time approximation schemes for two‐machine open shop scheduling with nonavailability constraints , 2006 .

[15]  Frits C. R. Spieksma,et al.  Modeling and solving the periodic maintenance problem , 2006, Eur. J. Oper. Res..

[16]  Vitaly A. Strusevich,et al.  Two-machine flow shop no-wait scheduling with machine maintenance , 2005, 4OR.

[17]  Rina Dechter,et al.  Maintenance scheduling problems as benchmarks for constraint algorithms , 1999, Annals of Mathematics and Artificial Intelligence.

[18]  Zhi-Long Chen,et al.  Scheduling jobs and maintenance activities on parallel machines , 2000 .

[19]  Celia A. Glass,et al.  Scheduling maintenance services to three machines , 1999, Ann. Oper. Res..

[20]  Wieslaw Kubiak,et al.  Two-machine flow shops with limited machine availability , 2002, Eur. J. Oper. Res..

[21]  Vitaly A. Strusevich,et al.  Two-machine open shop scheduling with an availability constraint , 2001, Oper. Res. Lett..

[22]  Teofilo F. Gonzalez,et al.  Open Shop Scheduling to Minimize Finish Time , 1976, JACM.

[23]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[24]  Celia A. Glass,et al.  The Scheduling of Maintenance Service , 1998, Discret. Appl. Math..

[25]  T. C. Edwin Cheng,et al.  An improved heuristic for two-machine flowshop scheduling with an availability constraint , 2000, Oper. Res. Lett..

[26]  Chung-Yee Lee,et al.  Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint , 1997, Oper. Res. Lett..

[27]  Vitaly A. Strusevich,et al.  Non-preemptive two-machine open shop scheduling with non-availability constraints , 2003, Math. Methods Oper. Res..

[28]  Lu Lu,et al.  An NP-Hard Open Shop Scheduling Problem with Polynomial Average Time Complexity , 1993, Math. Oper. Res..