# Approximation algorithms for scheduling unrelated parallel machines

- 1.9k Downloads
- 341 Citations

## Abstract

We consider the following scheduling problem. There are*m* parallel machines and*n* independent jobs. Each job is to be assigned to one of the machines. The processing of job*j* on machine*i* requires time*p*_{ ij }. 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 unless*P* = NP. We finally obtain a complexity classification for all special cases with a fixed number of processing times.

## Key words

Scheduling parallel machines approximation algorithm worst case analysis linear programming integer programming rounding## Preview

Unable to display preview. Download preview PDF.

## References

- R. Aharoni, P. Erdös and N. Linial, “Dual integer linear programs and the relationship between their optima,”
*Proceedings of the 17th Annual ACM Symposium on Theory of Computing*(1985) 476–483.Google Scholar - J.J. Bartholdi III, “A guaranteed-accuracy round-off algorithm for cyclic scheduling and set covering,”
*Operations Research*29 (1981) 501–510.Google Scholar - J.J. Bartholdi III, J.B. Orlin and H.D. Ratliff, “Cyclic scheduling via integer programs with circular ones,”
*Operations Research*28 (1980) 1074–1085.Google Scholar - S. Baum and L.E. Trotter Jr., “Integer rounding for polymatroid and branching optimization problems,”
*SIAM Journal on Algebraic and Discrete Methods*2 (1981) 416–425.Google Scholar - V. Chvátal, “A greedy heuristic for the set-covering problem,”
*Mathematics of Operations Research*4 (1979) 233–235.Google Scholar - G.B. Dantzig,
*Linear Programming and Extensions*(Princeton University Press, Princeton, NJ, 1963).Google Scholar - E. Davis and J.M. Jaffe, “Algorithms for scheduling tasks on unrelated processors,”
*Journal of the Association for Computing Machinery*28 (1981) 721–736.Google Scholar - M.R. Garey and D.S. Johnson, “Complexity results for multiprocessor scheduling under resource constraints,”
*SIAM Journal on Computing*4 (1975) 397–411.Google Scholar - M.R. Garey and D.S. Johnson, “Strong NP-completeness results: motivation, examples and implications,”
*Journal of the Association for Computing Machinery*25 (1978) 499–508.Google Scholar - M.R. Garey and D.S. Johnson,
*Computers and Intractability: a Guide to the Theory of NP-Completeness*(Freeman, San Francisco, CA, 1979).Google Scholar - T. Gonzalez, O.H. Ibarra and S. Sahni, “Bounds for LPT schedules on uniform processors,”
*SIAM Journal on Computing*6 (1977) 155–166.Google Scholar - R.L. Graham, “Bounds for certain multiprocessing anomalies,”
*Bell System Technological Journal*45 (1966) 1563–1581.Google Scholar - R.L. Graham, “Bounds on multiprocessing timing anomalies,”
*SIAM Journal on Applied Mathematics*17 (1969) 416–429.Google Scholar - R.L. Graham, E.L. Lawler, J.K. Lenstra and A.H.G. Rinnooy Kan, “Optimization and approximation in deterministic sequencing and scheduling: a survey,”
*Annals of Discrete Mathematics*5 (1979) 287–326.Google Scholar - M. Grötschel, L. Lovász and A. Schrijver,
*Geometric Algorithms and Combinatorial Optimization*(Springer, Berlin, 1988).Google Scholar - D.S. Hochbaum and D.B. Shmoys, “Using dual approximation algorithms for scheduling problems: practical and theoretical results,”
*Journal of the Association for Computing Machinery*34 (1987) 144–162.Google Scholar - D.S. Hochbaum and D.B. Shmoys, “A polynomial approximation scheme for machine scheduling on uniform processors: using the dual approximation approach,”
*SIAM Journal on Computing*17 (1988) 539–551.Google Scholar - E. Horowitz and S. Sahni, “Exact and approximate algorithms for scheduling nonidentical processors,”
*Journal of the Association for Computing Machinery*23 (1976) 317–327.Google Scholar - L.G. Khachian, “A polynomial time algorithm in linear programming, “
*Soviet Mathematics Doklady*20 (1979) 191–194.Google Scholar - L. Lovász, “On the ratio of optimal and fractional covers,”
*Discrete Applied Mathematics*13 (1983) 383–390.Google Scholar - O.M.-C. Marcotte,
*Topics in Combinatorial Packing and Covering*, Ph.D. Thesis, School of Operations Research and Industrial Engineering, Cornell University (Ithaca, NY, 1983).Google Scholar - K. Numata, “Approximate and exact algorithms for scheduling independent tasks on unrelated processors,”
*Journal of the Operations Research Society of Japan*31 (1988) 61–81.Google Scholar - C.N. Potts, “Analysis of a linear programming heuristic for scheduling unrelated parallel machines,”
*Discrete Applied Mathematics*10 (1985) 155–164.Google Scholar - P. Raghavan, “Probabilistic construction of deterministic algorithms: approximating packing integer programs,”
*Proceedings of the 27th Annual IEEE Symposium on Foundations of Computer Science*(1986) 10–18.Google Scholar - P. Raghavan and C.D. Thompson, “Provably good routing in graphs: regular arrays,”
*Proceedings of the 17th Annual ACM Symposium on Theory of Computing*(1985) 79–87.Google Scholar - S. Sahni, “Algorithms for scheduling independent tasks,”
*Journal of the Association for Computing Machinery*23 (1976) 116–127.Google Scholar - A. Schrijver, “Min-Max results in combinatorial optimization,” in: A. Bachem, M. Grötschel and B. Korte, eds.,
*Mathematical Programming: The State of the Art—Bonn 1982*(Springer, Berlin, 1983) pp. 439–500.Google Scholar - A. Schrijver,
*Theory of Linear and Integer Programming*(Wiley, Chichester, 1986).Google Scholar