Approximation algorithms for scheduling unrelated parallel machines

We consider the following scheduling problem. There arem parallel machines andn independent jobs. Each job is to be assigned to one of the machines. The processing of jobj on machinei requires timepij. The objective is to find a schedule that minimizes the makespan.Our main result is a polynomial algorithm which constructs a schedule that is guaranteed to be no longer than twice the optimum. We also present a polynomial approximation scheme for the case that the number of machines is fixed. Both approximation results are corollaries of a theorem about the relationship of a class of integer programming problems and their linear programming relaxations. In particular, we give a polynomial method to round the fractional extreme points of the linear program to integral points that nearly satisfy the constraints.In contrast to our main result, we prove that no polynomial algorithm can achieve a worst-case ratio less than 3/2 unlessP = NP. We finally obtain a complexity classification for all special cases with a fixed number of processing times.

[1]  Prabhakar Raghavan,et al.  Probabilistic construction of deterministic algorithms: Approximating packing integer programs , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[2]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[3]  Oscar H. Ibarra,et al.  Bounds for LPT Schedules on Uniform Processors , 1977, SIAM J. Comput..

[4]  László Lovász,et al.  On the ratio of optimal integral and fractional covers , 1975, Discret. Math..

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

[6]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

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

[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]  Kazumiti Numata,et al.  APPROXIMATE AND EXACT ALGORITHMS FOR SCHEDULING INDEPENDENT TASKS ON UNRELATED PROCESSORS , 1988 .

[10]  James B. Orlin,et al.  Cyclic Scheduling via Integer Programs with Circular Ones , 1980, Oper. Res..

[11]  L. Trotter,et al.  Integer Rounding for Polymatroid and Branching Optimization Problems , 1981 .

[12]  David S. Johnson,et al.  `` Strong '' NP-Completeness Results: Motivation, Examples, and Implications , 1978, JACM.

[13]  David S. Johnson,et al.  Complexity Results for Multiprocessor Scheduling under Resource Constraints , 1975, SIAM J. Comput..

[14]  David B. Shmoys,et al.  A Polynomial Approximation Scheme for Machine Scheduling on Uniform Processors: Using the Dual Approximation Approach , 1986, FSTTCS.

[15]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[16]  C. N. Potts,et al.  Analysis of a linear programming heuristic for scheduling unrelated parallel machines , 1985, Discret. Appl. Math..

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

[18]  Alexander Schrijver,et al.  Min-Max Results in Combinatorial Optimization , 1982, ISMP.

[19]  Ronald L. Graham,et al.  Bounds for certain multiprocessing anomalies , 1966 .

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

[21]  John J. Bartholdi,et al.  A Guaranteed-Accuracy Round-off Algorithm for Cyclic Scheduling and Set Covering , 1981, Oper. Res..

[22]  Paul Erdös,et al.  Dual integer linear programs and the relationship between their optima , 1985, STOC '85.

[23]  Jeffrey M. Jaffe,et al.  Algorithms for Scheduling Tasks on Unrelated Processors , 1981, JACM.

[24]  George B. Dantzig,et al.  Linear programming and extensions , 1965 .

[25]  Prabhakar Raghavan,et al.  Provably good routing in graphs: regular arrays , 1985, STOC '85.

[26]  David B. Shmoys,et al.  Using dual approximation algorithms for scheduling problems: practical and theoretical results , 1987 .

[27]  J. G. Pierce,et al.  Geometric Algorithms and Combinatorial Optimization , 2016 .

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