Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance

This research focuses on the problem of scheduling jobs on a single machine that requires periodic maintenance with the objective of minimizing the number of tardy jobs. We present a two-phase heuristic algorithm in which an initial solution is obtained first with a method modified from Moore's algorithm for the problem without maintenance and then the solution is improved in the second phase. Performance of the proposed heuristic algorithm is evaluated through computational experiments on randomly generated problem instances and results show that the heuristic gives solutions close to those obtained from a commercial integer programming solver in much shorter time and works better than an existing heuristic algorithm in terms of the solution quality.

[1]  Jen-Shiang Chen,et al.  Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan , 2008, Eur. J. Oper. Res..

[2]  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.

[3]  Christophe Varnier,et al.  Single-machine scheduling with periodic and flexible periodic maintenance to minimize maximum tardiness , 2008, Comput. Ind. Eng..

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

[5]  Yih-Bor Wu,et al.  Minimum number of tardy jobs in single machine scheduling with release dates—an improved algorithm , 1987 .

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

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

[8]  Ghasem Moslehi,et al.  Minimizing the number of tardy jobs under piecewise-linear deterioration , 2010, Comput. Ind. Eng..

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

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

[11]  L. B. J. M. Sturm.  A Simple Optimality Proof of Moore's Sequencing Algorithm , 1970 .

[12]  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 .

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

[14]  R. Uzsoy,et al.  Production scheduling algorithms for a semiconductor test facility , 1989, IEEE/SEMI International Semiconductor Manufacturing Science Symposium.

[15]  Stéphane Dauzère-Pérès,et al.  An Exact Method to Minimize the Number of Tardy Jobs in Single Machine Scheduling , 2004, J. Sched..

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

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

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

[19]  J. M. Moore.  An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs , 1968 .

[20]  Philippe Baptiste,et al.  An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs , 1999, Oper. Res. Lett..

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

[22]  E. L. Lawler,et al.  A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs , 1991 .

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

[24]  Toshihide Ibaraki,et al.  A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times , 1978, Oper. Res..

[25]  Ron Shamir,et al.  Minimizing the number of tardy job units under release time constraints , 1990, Discret. Appl. Math..

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

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

[28]  Philippe Baptiste,et al.  A branch and bound to minimize the number of late jobs on a single machine with release time constraints , 2003, Eur. J. Oper. Res..

[29]  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.

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

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

[32]  Gur Mosheiov,et al.  Scheduling jobs under simple linear deterioration , 1994, Comput. Oper. Res..

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

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