Scheduling with Release Times and Deadlines on a Minimum Number of Machines

In this paper we study the SRDM problem motivated by a variety of practical applications. We are given n jobs with integer release times,deadlines, and processing times. The goal is to find a non-preemptive schedule such that all jobs meet their deadlines and the number of machines needed to process all jobs is minimum. If all jobs have equal release times and equal deadlines, SRDM is the classical bin packing problem, which is NP-complete. The slack of a job is the difference between its release time and the last possible time it may be started while still meeting its deadline. We show that instances consisting of jobs with slack at most one can be solved efficiently. We close the resulting gap by showing that the problem already becomes NP-complete if slacks up to 2 are allowed. Additionally, we consider several variants of the SRDM problem and provide exact and approximation algorithms.

[1]  Federico Malucelli,et al.  Shiftable Interval Graphs , 2000 .

[2]  Stephan Eidenbenz,et al.  Flexible Train Rostering , 2003, ISAAC.

[3]  Edward G. Coffman,et al.  Approximation algorithms for bin packing: a survey , 1996 .

[4]  Eugene L. Lawler,et al.  Chapter 9 Sequencing and scheduling: Algorithms and complexity , 1993, Logistics of Production and Inventory.

[5]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[6]  Rafail Ostrovsky,et al.  Approximation algorithms for the job interval selection problem and related scheduling problems , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[7]  Frits C. R. Spieksma,et al.  Interval selection: applications, algorithms and lower bounds , 2002 .

[8]  Frits C. R. Spieksma,et al.  Approximating an Interval Scheduling Problem , 1998, APPROX.

[9]  A. Brandstädt,et al.  Graph Classes: A Survey , 1987 .

[10]  Eugene L. Lawler,et al.  Sequencing and scheduling: algorithms and complexity , 1989 .

[11]  Joseph Naor,et al.  New hardness results for congestion minimization and machine scheduling , 2004, STOC '04.

[12]  Fanica Gavril,et al.  Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph , 1972, SIAM J. Comput..

[13]  Sudipto Guha,et al.  Approximating the Throughput of Multiple Machines in Real-Time Scheduling , 2002, SIAM J. Comput..

[14]  Piotr Berman,et al.  Multi-phase Algorithms for Throughput Maximization for Real-Time Scheduling , 2000, J. Comb. Optim..

[15]  Robert E. Tarjan,et al.  A data structure for dynamic trees , 1981, STOC '81.

[16]  Reuven Bar-Yehuda,et al.  A unified approach to approximating resource allocation and scheduling , 2000, STOC '00.

[17]  G. S. Lueker,et al.  Bin packing can be solved within 1 + ε in linear time , 1981 .