Abstract
We give a new efficient approximation algorithm for schedul- ing precedence constrained jobs on machines with different speeds. The setting is as follows. There are n jobs 1, . . ., n where job j requires p j units of processing. The jobs are to be scheduled on a set of m machines. Machine i has a speed s i; it takes p j/s i units of time for machine i to pro- cess job j. The precedence constraints on the jobs are given in the form of a partial order. If j ≺ k, processing of k cannot start until j’s execution if finished. Let C j denote the completion time of job j. The objective is to find a schedule to minimize C max = maxj C j, conventionally called the makespan of the schedule. We consider non-preemptive schedules where each job is processed on a single machine with no preemptions. Recently Chudak and Shmoys [1] gave an algorithm with an approximation ra- tio of O(log m) significantly improving the earlier ratio of O(√m) due to Jaffe [7]. Their algorithm is based on solving a linear programming relaxation of the problem. Building on some of their ideas, we present a combinatorial algorithm that achieves a similar approximation ratio but runs in O(n 3) time. In the process we also obtain a constant factor approximation algorithm for the special case of precedence constraints induced by a collection of chains. Our algorithm is based on a new lower bound which we believe is of independent interest. By a general result of Shmoys, Wein, and Williamson [10] our algorithm can be extended to obtain an O(logm) approximation ratio even if jobs have release dates.
Supported primarily by an IBM Cooperative Fellowship. Remaining support was provided by an ARO MURI Grant DAAH04-96-1-0007 and NSF Award CCR-9357849, with matching funds from IBM, Schlumberger Foundation, Shell Foundation, and Xerox Corporation.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
F. Chudak and D. Shmoys. Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds. Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1997.
D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progression. Proceedings of the 19th ACM Symposium on Theory of Computing, pages 1–6, 1987.
M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979.
R.L. Graham. Bounds for certain multiprocessor anomalies. Bell System Tech. J., 45:1563–81, 1966.
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. Ann. Discrete Math., 5:287–326, 1979.
E. Horvath, S. Lam, and R. Sethi. A level algorithm for preemptive scheduling. Journal of the ACM, 24(1):32–43, 1977.
J. Jaffe. Efficient scheduling of tasks without full use of processor resources. Theoretical Computer Science, 26:1–17, 1980.
J. K. Lenstra and A. H. G. Rinnooy Kan. Complexity of scheduling under precedence constraints. Operations Research, 26:22–35, 1978.
J. W. S. Lui and C. L. Lui. Bounds on scheduling algorithms for heterogeneous computing systems. In J. L. Rosenfeld, editor, Information Processing 74, pages 349–353. North-Holland, 1974.
D. Shmoys, J. Wein, and D. Williamson. Scheduling parallel machines on-line. SIAM Journal on Computing, 24:1313–31, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chekuri, C., Bender, M. (1998). An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines. In: Bixby, R.E., Boyd, E.A., Ríos-Mercado, R.Z. (eds) Integer Programming and Combinatorial Optimization. IPCO 1998. Lecture Notes in Computer Science, vol 1412. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-69346-7_29
Download citation
DOI: https://doi.org/10.1007/3-540-69346-7_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64590-0
Online ISBN: 978-3-540-69346-8
eBook Packages: Springer Book Archive