A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization

We consider the single machine scheduling problem with release dates and tails, provided that the machine is unavailable during a fixed interval. We aim to minimize the maximum delivery time under the nonresumable senario. This problem is strongly NP-hard. The proposed algorithm is based on a branch-and-bound method. We use Jackson's preemptive algorithm with precedence constraints to compute the lower bound and Schrage's sequence as an upper bound. Numerical experiments show that the algorithm can solve large-size instances with up to 1000 jobs.

[1]  Lei Shi,et al.  Single Machine Scheduling with Forbidden Intervals and Job Delivery Times , 2008, Asia Pac. J. Oper. Res..

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

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

[4]  C. N. Potts,et al.  Technical Note - Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times , 1980, Oper. Res..

[5]  W. A. Horn.  Some simple scheduling algorithms , 1974 .

[6]  Eugene L. Lawler,et al.  On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming , 1978, JACM.

[7]  Imed Kacem.  Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval , 2009, J. Comb. Optim..

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

[9]  Mohamed Haouari,et al.  Approximation algorithms for single machine scheduling with one unavailability period , 2009, 4OR.

[10]  Chengbin Chu,et al.  A survey of scheduling with deterministic machine availability constraints , 2010, Comput. Ind. Eng..

[11]  Hans Kellerer,et al.  Efficient Approximation Schemes for the Maximum Lateness Minimization on a Single Machine with a Fixed Operator or Machine Non-Availability Interval , 2014, ISCO.

[12]  J. Carlier.  The one-machine sequencing problem , 1982 .

[13]  Jean-Charles Billaut,et al.  New Single Machine and Job-Shop Scheduling Problems with Availability Constraints , 2005, J. Sched..

[14]  M. I. Dessouky,et al.  The One-Machine Sequencing Problem with Early Starts and Due Dates , 1972 .

[15]  E. Nowicki,et al.  A note on minimizing maximum lateness in a one-machine sequencing problem with release dates , 1986 .