Approximation algorithms for single machine scheduling with one unavailability period

In this paper, we investigate the single machine scheduling problem with release dates and tails and a planned unavailability time period. We show that the problem admits a fully polynomial-time approximation scheme when the tails are equal. We derive an approximation algorithm for the general case and we show that the worst-case bound of the sequence yielded by Schrage’s algorithm is equal to 2 and that this bound is tight. Some consequences of this result are also presented.

[1]  David B. Shmoys,et al.  Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better , 1992, Math. Oper. Res..

[2]  Eugene Levner,et al.  Fast approximation algorithm for job sequencing with deadlines , 1981, Discret. Appl. Math..

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

[4]  Eugene L. Lawler,et al.  Sequencing and Scheduling: Algorithms and Complexity, in Logistics of production and inventory , 1993 .

[5]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[6]  Wieslaw Kubiak,et al.  A Fully Polynomial Approximation Scheme for the Weighted Earliness-Tardiness Problem , 1999, Oper. Res..

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

[8]  Gerhard J. Woeginger,et al.  When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)? , 2000, INFORMS J. Comput..

[9]  Gerhard J. Woeginger,et al.  A comment on scheduling two parallel machines with capacity constraints , 2005, Discret. Optim..

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

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

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

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

[14]  Chung-Yee Lee,et al.  Machine Scheduling with Availability Constraints , 2004, Handbook of Scheduling.

[15]  Oscar H. Ibarra,et al.  Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems , 1975, JACM.

[16]  Sartaj Sahni,et al.  Algorithms for Scheduling Independent Tasks , 1976, J. ACM.

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

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

[19]  Hans Kellerer,et al.  Fully Polynomial Approximation Schemes for a Symmetric Quadratic Knapsack Problem and its Scheduling Applications , 2010, Algorithmica.

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