A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines

We consider the well known problem of scheduling jobs with release dates to minimize their average weighted completion time. When multiple machines are available, the machine environment may range from identical machines (the processing time required by a job is invariant across the machines) at one end of the spectrum to unrelated machines (the processing time required by a job on each machine is specified by an arbitrary vector) at the other end. While the problem is strongly NP-hard even in the case of a single machine, constant factor approximation algorithms are known for even the most general machine environment of unrelated machines. Recently a PTAS was discovered for the case of identical parallel machines [1]. In contrast, the problem is MAX SNP-hard for unrelated machines [11]. An important open problem was to determine the approximability of the intermediate case of uniformly related machines where each machine has a speed and it takes p/s time to process a job of size p on a machine with speed s. We resolve the complexity of this problem by obtaining a PTAS. This improves the earlier known approximation ratio of (2 + Ɛ).

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

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

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

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

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

[6]  Evripidis Bampis,et al.  Approximation schemes for minimizing average weighted completion time with release dates , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

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

[8]  Sanjeev Khanna,et al.  A PTAS for the multiple knapsack problem , 2000, SODA '00.

[9]  David B. Shmoys,et al.  A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach , 1988, SIAM J. Comput..

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

[11]  David B. Shmoys,et al.  Using dual approximation algorithms for scheduling problems: Theoretical and practical results , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

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

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

[14]  Han Hoogeveen,et al.  Non-Approximability Results for Scheduling Problems with Minsum Criteria , 1998, INFORMS J. Comput..

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

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

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