Minimizing number of tardy jobs on a single machine subject to periodic maintenance

This paper considers a single-machine scheduling problem with periodic maintenance. In this study, a schedule consists of several maintenance periods and each maintenance period is scheduled after a periodic time interval. The objective is to find a schedule that minimizes the number of tardy jobs subject to periodic maintenance and nonresumable jobs. Based on the Moore's algorithm, an effective heuristic is developed to provide a near-optimal schedule for the problem. A branch-and-bound algorithm is also proposed to find the optimal schedule. Some important theorems associated with the problem are implemented in the algorithm. Computational results are presented to demonstrate the effectiveness of the proposed heuristic.

[1]  Gur Mosheiov,et al.  Minimizing the sum of job completion times on capacitated parallel machines , 1994 .

[2]  Wieslaw Kubiak,et al.  Heuristic algorithms for the two-machine flowshop with limited machine availability ☆ , 2001 .

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

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

[5]  T. C. Edwin Cheng,et al.  Single-machine scheduling with periodic maintenance to minimize makespan , 2007, Comput. Oper. Res..

[6]  Günter Schmidt,et al.  Scheduling Independent Tasks with Deadlines on Semi-identical Processors , 1988 .

[7]  Chung-Yee Lee,et al.  Parallel machines scheduling with nonsimultaneous machine available time , 1991, Discret. Appl. Math..

[8]  Chung-Yee Lee,et al.  Single-machine scheduling with maintenance and repair rate-modifying activities , 2001, Eur. J. Oper. Res..

[9]  Ali Allahverdi,et al.  Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness , 1996, Comput. Oper. Res..

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

[11]  Eric Sanlaville,et al.  Nearly on Line Scheduling of Preemptive Independent Tasks , 1995, Discret. Appl. Math..

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

[13]  Chung-Yee Lee,et al.  Single machine flow-time scheduling with scheduled maintenance , 1992, Acta Informatica.

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

[15]  Marie-Laure Espinouse,et al.  Minimizing the makespan in the two-machine no-wait flow-shop with limited machine availability , 1999 .

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

[17]  G. Rand.  Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop , 1982 .

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

[19]  Michael Pinedo,et al.  Current trends in deterministic scheduling , 1997, Ann. Oper. Res..

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