Approximation schemes for minimizing average weighted completion time with release dates

We consider the problem of scheduling n jobs with release dates on m machines so as to minimize their average weighted completion time. We present the first known polynomial time approximation schemes for several variants of this problem. Our results include PTASs for the case of identical parallel machines and a constant number of unrelated machines with and without preemption allowed. Our schemes are efficient: for all variants the running time for /spl alpha/(1+/spl epsiv/) approximation is of the form f(1//spl epsiv/, m)poly(n).

[1]  Eric Torng,et al.  Lower bounds for SRPT-subsequence algorithms for nonpreemptive scheduling , 1999, SODA '99.

[2]  Éva Tardos,et al.  An approximation algorithm for the generalized assignment problem , 1993, Math. Program..

[3]  Martin Skutella,et al.  Semidefinite relaxations for parallel machine scheduling , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

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

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

[6]  Gerhard J. Woeginger,et al.  A PTAS for minimizing the weighted sum of job completion times on parallel machines , 1999, STOC '99.

[7]  Han Hoogeveen,et al.  Non-approximability Results for Scheduling Problems with Minsum Criteria , 1998, IPCO.

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

[9]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[10]  Rajeev Motwani,et al.  Minimizing weighted completion time on a single machine , 1999, SODA '99.

[11]  Robert McNaughton,et al.  Scheduling with Deadlines and Loss Functions , 1959 .

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

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

[14]  Maurice Queyranne,et al.  Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems , 1998, IPCO.

[15]  Rajeev Motwani,et al.  Precedence Constrained Scheduling to Minimize Sum of Weighted Completion Times on a Single Machine , 1999, Discret. Appl. Math..

[16]  Edward G. Coffman,et al.  Scheduling independent tasks to reduce mean finishing time , 1974, CACM.

[17]  N. Alon,et al.  Approximation schemes for scheduling on parallel machines , 1998 .

[18]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

[19]  David P. Williamson,et al.  A 1.47-approximation algorithm for a preemptive single-machine scheduling problem , 2000, Oper. Res. Lett..

[20]  R. Motwani,et al.  Precedence Constrained Scheduling to Minimize Weighted Completion Time on a Single Machine , 1998 .

[21]  W. A. Horn.  Technical Note - Minimizing Average Flow Time with Parallel Machines , 1973, Oper. Res..

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

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

[24]  Ellis Horowitz,et al.  Exact and Approximate Algorithms for Scheduling Nonidentical Processors , 1976, JACM.

[25]  Martin Skutella,et al.  Convex Quadratic Programming Relaxations for Network Scheduling Problems , 1999, ESA.

[26]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[27]  Cynthia A. Phillips,et al.  Improved Scheduling Algorithms for Minsum Criteria , 1996, ICALP.

[28]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[29]  Cynthia A. Phillips,et al.  Minimizing average completion time in the presence of release dates , 1998, Math. Program..