Abstract
In this paper we present a polynomial approximation scheme for the minimum makespan problem on uniform parallel processors. More specifically, the problem is to find a schedule for a set of independent jobs on a collection of machines of different speeds so that the last job to finish is completed as quickly as possible. We give a family of polynomial-time algorithms {A ∈} such that A ∈ delivers a solution that is within a relative error of ε of the optimum. The technique employed is the dual approximation approach, where infeasible but superoptimal solutions for a related (dual) problem are converted to the desired feasible but possibly suboptimal solution.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
6. References
Y. Cho and S. Sahni (1980). “Bounds for list schedules on uniform processors,” SIAM J. Comput. 9, 91–103.
D.K. Friesen and M.A. Langston (1983). “Bounds for Multifit scheduling on uniform processors,” SIAM J. Comp. 12, 60–70.
M.R. Garey and D.S. Johnson (1979). Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, San Francisco.
T. Gonzalez, O.H. Ibarra and S. Sahni (1977). “Bounds for LPT schedules on uniform processors,” SIAM J. Comput. 6, 155–166.
R.L. Graham (1966). “Bounds for certain multiprocessing anomalies,” Bell System Tech. J. 45, 1563–1581.
D.S. Hochbaum and D.B. Shmoys (1985). “Using dual approximation algorithms for scheduling problems: practical and theoretical results,” JACM, to appear.
R. Horowitz and S. Sahni (1976). “Exact and approximate algorithms for scheduling non-identical processors,” JACM 23, 317–327.
J.W.S. Liu and C.L. Liu (1974). “Bounds on scheduling algorithms for heterogeneous computing systems,” Proc. of 1974 IFIP Congress, 349–353.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hochbaum, D.S., Shmoys, D.B. (1986). A polynomial approximation scheme for machine scheduling on uniform processors: Using the dual approximation approach. In: Nori, K.V. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1986. Lecture Notes in Computer Science, vol 241. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17179-7_23
Download citation
DOI: https://doi.org/10.1007/3-540-17179-7_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17179-9
Online ISBN: 978-3-540-47239-1
eBook Packages: Springer Book Archive