A branch and bound algorithm to minimize total tardiness of jobs in a two identical-parallel-machine scheduling problem with a machine availability constraint

This research focuses on the problem of scheduling jobs on two identical parallel machines that are not continuously available with the objective of minimizing total tardiness. After processing a given number of jobs, each machine requires a preventive maintenance task, during which the machine cannot process jobs. We present dominance properties and lower bounds, and develop a branch and bound algorithm using these properties and lower bounds as well as an upper bound obtained from a heuristic algorithm. Performance of the algorithm is evaluated through a series of computational experiments on randomly generated instances and results are reported.

[1]  Joseph Y.-T. Leung,et al.  Minimizing Total Tardiness on One Machine is NP-Hard , 1990, Math. Oper. Res..

[2]  Yeong-Dae Kim.  Minimizing total tardiness in permutation flowshops , 1995 .

[3]  Chwen-Tzeng Su,et al.  A single-machine scheduling problem with maintenance activities to minimize makespan , 2010, Appl. Math. Comput..

[4]  Chien-Hung Lin,et al.  Makespan minimization for two parallel machines with an unavailable period on each machine , 2007 .

[5]  C.-H. Lin,et al.  Minimizing makespan for two parallel machines with job limit on each availability interval , 2007, J. Oper. Res. Soc..

[6]  Michael Pinedo,et al.  A Note on Stochastic Scheduling on a Single Machine Subject to Breakdown and Repair , 1988, Probability in the Engineering and Informational Sciences.

[7]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[8]  Johnny Wong,et al.  Makespan minimization for m parallel identical processors , 1995 .

[9]  Meral Azizoglu,et al.  An efficient algorithm for the single machine tardiness problem , 1994 .

[10]  Sang-Heon Lee,et al.  Heuristic Algorithm for the Single-machine Scheduling with Periodic Maintenance , 2008 .

[11]  Wen-Jinn Chen,et al.  Minimizing number of tardy jobs on a single machine subject to periodic maintenance , 2009 .

[12]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[13]  Chung-Yee Lee,et al.  Machine scheduling with an availability constraint , 1996, J. Glob. Optim..

[14]  Chengbin Chu,et al.  Parallel machine scheduling to minimize total tardiness , 2002 .

[15]  Sun Hur,et al.  A Preventive Maintenance Scheduling Model of the Cluster Tool , 2012 .

[16]  Ram Mohan V. Rachamadugu,et al.  Technical Note - A Note on the Weighted Tardiness Problem , 1987, Oper. Res..

[17]  S. Martello,et al.  Bounds for the cardinality constrained P∥Cmax problem , 2001 .

[18]  Esther Frostig,et al.  A Note on Stochastic Scheduling on a Single Machine Subject to Breakdown–The Preemptive Repeat Model , 1991, Probability in the Engineering and Informational Sciences.

[19]  Jay B. Ghosh,et al.  Scheduling with tool changes to minimize total completion time: Basic results and SPT performance , 2004, Eur. J. Oper. Res..

[20]  Jeffrey E. Schaller,et al.  Note on Shim and Kim's lower bounds for scheduling on identical parallel machines to minimize total tardiness , 2009, Eur. J. Oper. Res..

[21]  A.H.G. Rinnooy Kan,et al.  Scheduling on a single machine with a single breakdown to minimize stochastically the number of tardy jobs , 1991 .

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

[23]  W. J. Chen,et al.  Single-machine scheduling with periodic maintenance and nonresumable jobs , 2003, Comput. Oper. Res..

[24]  Alexander H. G. Rinnooy Kan,et al.  Single machine flow-time scheduling with a single breakdown , 1989, Acta Informatica.

[25]  Christos Koulamas.  Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem , 1997 .

[26]  Jay B. Ghosh,et al.  Scheduling with tool changes to minimize total completion time: A study of heuristics and their performance , 2003 .

[27]  Chang-Hoon Lie,et al.  Optimal Preventive Maintenance Policy with Cost-dependent Improvement Factor , 2010 .

[28]  Jatinder N. D. Gupta,et al.  Scheduling tasks on a flexible manufacturing machine to minimize tool change delays , 2005, Eur. J. Oper. Res..

[29]  C. Chu.  A branch-and-bound algorithm to minimize total tardiness with different release dates , 1992 .

[30]  Dehua Xu,et al.  Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan , 2008, Comput. Oper. Res..

[31]  Ji-Bo Wang,et al.  Parallel machines scheduling with a deteriorating maintenance activity , 2011, J. Oper. Res. Soc..

[32]  Chris N. Potts,et al.  A Branch and Bound Algorithm for the Total Weighted Tardiness Problem , 1985, Oper. Res..

[33]  Sankar Sengupta,et al.  Integrating Machine Reliability and Preventive Maintenance Planning in Manufacturing Cell Design , 2008 .

[34]  W. J. Chen,et al.  Minimizing total flow time in the single-machine scheduling problem with periodic maintenance , 2006, J. Oper. Res. Soc..

[35]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[36]  Yeong-Dae Kim,et al.  Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance , 2012, Comput. Oper. Res..

[37]  Jen-Shiang Chen.  Optimization models for the tool change scheduling problem , 2008 .

[38]  A.H.G. Rinnooy Kan,et al.  Single‐machine scheduling subject to stochastic breakdowns , 1990 .

[39]  Yeong-Dae Kim,et al.  Tool replacement policies for a machining centre producing multiple types of products with distinct due dates , 2001 .

[40]  Chung-Yee Lee,et al.  Capacitated Two-Parallel Machines Scheduling to Minimize Sum of Job Completion Times , 1993, Discret. Appl. Math..

[41]  Chien-Hung Lin,et al.  Makespan minimization for two parallel machines with an availability constraint , 2005, Eur. J. Oper. Res..

[42]  M. Azizoglu,et al.  Tardiness minimization on parallel machines , 1998 .

[43]  Shunji Tanaka,et al.  A branch-and-bound algorithm with Lagrangian relaxation to minimize total tardiness on identical parallel machines , 2008 .

[44]  Gur Mosheiov,et al.  Scheduling a maintenance activity on parallel identical machines , 2009 .

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

[46]  Maher Rebai,et al.  Scheduling jobs and maintenance activities on parallel machines , 2013, Oper. Res..

[47]  Yeong-Dae Kim,et al.  Scheduling on parallel identical machines to minimize total tardiness , 2007, Eur. J. Oper. Res..

[48]  Mohamed Haouari,et al.  Optimal parallel machines scheduling with availability constraints , 2005, Discret. Appl. Math..

[49]  J. S. Chen,et al.  Single-machine scheduling with flexible and periodic maintenance , 2006, J. Oper. Res. Soc..