Approximation schemes for scheduling on parallel machines

We discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The goal is to optimize objective functions that solely depend on the machine completion times. As a main result, we identify some conditions on the objective function, under which the resulting scheduling problems possess a polynomial-time approximation scheme. Our result contains, generalizes, improves, simplifies, and unifies many other results in this area in a natural way.

[1]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[2]  Chak-Kuen Wong,et al.  Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation , 1975, SIAM J. Comput..

[3]  Edward G. Coffman,et al.  Record Allocation for Minimizing Expected Retrieval Costs on Drum-Like Storage Devices , 1976, J. ACM.

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

[5]  D. K. Friesen,et al.  Analysis of Greedy Solutions for a Replacement Part Sequencing Problem , 1981, Math. Oper. Res..

[6]  D. K. Friesen,et al.  SCHEDULING TO MAXIMIZE THE MINIMUM PROCESSOR FINISH TIME IN A MULTIPROCESSOR SYSTEM , 1982 .

[7]  Hendrik W. Lenstra,et al.  Integer Programming with a Fixed Number of Variables , 1983, Math. Oper. Res..

[8]  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).

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

[10]  Gerhard J. Woeginger,et al.  The exact LPT-bound for maximizing the minimum completion time , 1992, Oper. Res. Lett..

[11]  Joseph Y.-T. Leung,et al.  Tighter Bounds on a Heuristic for a Partition Problem , 1995, Inf. Process. Lett..

[12]  Noga Alon,et al.  Approximation schemes for scheduling , 1997, SODA '97.

[13]  Gerhard J. Woeginger,et al.  A polynomial-time approximation scheme for maximizing the minimum machine completion time , 1997, Oper. Res. Lett..

[14]  Yossi Azar,et al.  Ancient and New Algorithms for Load Balancing in the lp Norm , 1998, SODA '98.