Parallel machine scheduling with maintenance activities

Parallel machine scheduling with maintenance activity.Makespan, sum of completion times, maximum lateness and sum of lateness.For each scheduling measure, the problem is proved to be strongly NP-hard.Some restricted cases are also characterized for their complexities. This paper considers a problem of scheduling on parallel machines where each machine requires maintenance activity once over a given time window. The objective is to find a coordinated schedule for jobs and maintenance activities to minimize the scheduling cost represented by either one of several objective measures including makespan, (weighted) sum of completion times, maximum lateness and sum of lateness. The problem is proved to be NP-hard in the strong sense in each case of the objective measures. Some restricted cases of the problem are also characterized for their complexities, for which the associated dynamic programming algorithms are derived.

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

[2]  Ghasem Moslehi,et al.  Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint , 2011, Comput. Math. Appl..

[3]  T.C.E. Cheng,et al.  A heuristic for scheduling jobs on two identical parallel machines with a machine availability constraint , 2015 .

[4]  C. Richard Cassady,et al.  Minimizing Job Tardiness Using Integrated Preventive Maintenance Planning and Production Scheduling , 2003 .

[5]  Lu-Wen Liao,et al.  Parallel machine scheduling with machine availability and eligibility constraints , 2008, Eur. J. Oper. Res..

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

[7]  Joaquín A. Pacheco,et al.  A single machine scheduling problem with availability constraints and sequence-dependent setup costs , 2011 .

[8]  T. C. Edwin Cheng,et al.  Two-Machine Flowshop Scheduling with Consecutive Availability Constraints , 1999, Inf. Process. Lett..

[9]  Cherif Sadfi,et al.  A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization , 2015, Appl. Math. Comput..

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

[11]  Jacek Blazewicz,et al.  An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints , 2005, Eur. J. Oper. Res..

[12]  Hongxing Li,et al.  Scheduling problems with multiple maintenance activities and non-preemptive jobs on two identical parallel machines , 2010 .

[13]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

[15]  Bin Fu,et al.  Approximation schemes for parallel machine scheduling with availability constraints , 2011, Discret. Appl. Math..

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

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

[18]  Chengbin Chu,et al.  Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times , 2009, Eur. J. Oper. Res..

[19]  Riad Aggoune,et al.  Minimizing the makespan for the flow shop scheduling problem with availability constraints , 2001, Eur. J. Oper. Res..

[20]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[21]  Chris N. Potts,et al.  Approximation results for flow shop scheduling problems with machine availability constraints , 2009, Comput. Oper. Res..

[22]  Chase Rainwater,et al.  Analysis of a parallel machine scheduling problem with sequence dependent setup times and job availability intervals , 2016, Eur. J. Oper. Res..

[23]  Antonio Costa,et al.  Minimizing the total completion time on a parallel machine system with tool changes , 2016, Comput. Ind. Eng..

[24]  Rym M'Hallah,et al.  A binary multiple knapsack model for single machine scheduling with machine unavailability , 2016, Comput. Oper. Res..