Off-line admission control for general scheduling problems

We consider a class of scheduling problems which includes a variety of problems that are exceedingly diicult to approximate (unless P=NP). In the face of very strong hardness results, we consider a relaxed notion of approximability and show that under this notion the problems yield constant-factor approximation algorithms (of a kind). Speciically we give a pseudopolynomial-time algorithm that, given an n-job instance whose optimal schedule has optimality criterion of value OPT, schedules a constant fraction of the n jobs within a constant factor times OPT. In many cases this can be converted to a fully polynomial-time algorithm. We then study the experimental performance of this algorithm and some additional heuristics. Speciically, we consider a set of instances of a one-machine scheduling problem that we have studied previously in the context of traditional approximation algorithms, where the goal is to optimize average weighted ow time. We show that for the instances that were hardest empirically for previous traditional approximation algorithms, a large fraction of the set of jobs can be scheduled using these techniques, with good performance. Our results are based on the existence of approximation algorithms for the nonpreemptive scheduling of jobs with release dates and due dates on one machine so as to maximize the (weighted) number of on-time jobs. As an additional contribution, we generalize the state of the art for such problems, giving the rst constant-factor approximation algorithms for the problem of scheduling jobs with resource requirements and release and due dates so as to optimize the weighted number of on-time jobs. In turn, this result further broadens the class of problems to which we can apply our relaxed-approximation result.

[1]  David B. Shmoys,et al.  Scheduling to minimize average completion time: off-line and on-line algorithms , 1996, SODA '96.

[2]  Prabhakar Raghavan,et al.  Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..

[3]  Martin Skutella,et al.  Scheduling-LPs Bear Probabilities: Randomized Approximations for Min-Sum Criteria , 1997, ESA.

[4]  Leslie A. Hall,et al.  Approximation algorithms for scheduling , 1996 .

[5]  R. N. Uma,et al.  On the Relationship Between Combinatorial and LP-Based Approaches to NP-Hard Scheduling Problems , 1998, IPCO.

[6]  Martin Skutella,et al.  Random-Based Scheduling: New Approximations and LP Lower Bounds , 1997, RANDOM.

[7]  Michael A. Bender,et al.  Flow and stretch metrics for scheduling continuous job streams , 1998, SODA '98.

[8]  van den Jm Marjan Akker,et al.  A time-indexed formulation for single-machine scheduling problems : column generation , 1996 .

[9]  Gerhard J. Woeginger,et al.  Approximability and nonapproximability results for minimizing total flow time on a single machine , 1996, STOC '96.

[10]  Cynthia A. Phillips,et al.  Task Scheduling in Networks , 1997, SIAM J. Discret. Math..

[11]  David B. Shmoys,et al.  Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms , 1997, Math. Oper. Res..

[12]  Martin Skutella,et al.  Single Machine Scheduling with Release Dates , 2002, SIAM J. Discret. Math..

[13]  Martin W. P. Savelsbergh,et al.  An experimental study of LP-based approximation algorithms for scheduling problems , 1998, SODA '98.

[14]  Cynthia A. Phillips,et al.  Scheduling Jobs that Arrive Over Time (Extended Abstract) , 1995, WADS.

[15]  Sudipto Guha,et al.  Approximating the throughput of multiple machines under real-time scheduling , 1999, STOC '99.

[16]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

[17]  Rajeev Motwani,et al.  Approximation techniques for average completion time scheduling , 1997, SODA '97.

[18]  Cynthia A. Phillips,et al.  Optimal Time-Critical Scheduling via Resource Augmentation , 1997, STOC '97.

[19]  David B. Shmoys,et al.  Improved approximation algorithms for minsum criteria , 1996 .

[20]  Michel X. Goemans,et al.  Improved approximation algorthims for scheduling with release dates , 1997, SODA '97.