Abstract
We consider the on-line problem of scheduling jobs with precedence constraints on m machines. We concentrate in two models, the model of uniformly related machines and the model of restricted assignment. For the related machines model, we show a lower bound of Ω(√m) for deterministic and randomized on-line algorithms, with or without preemptions even for jobs of known durations. This matches the deterministic upper bound of O(√m) given by Jaffe for task systems. The lower bound should be contrasted with the known bounds for jobs without precedence constraints. Specifically, without precedence constraints, if we allow preemptions then the competitive ratio becomes θ(logm), and if the durations of the jobs are known then there are O(1) competitive (preemptive and non-preemptive) algorithms.
We also consider the restricted assignment model. For the model with consistent precedence constraints, we give a (randomized) lower bound of Ω(logm) with or without preemptions. We show that the (deterministic) greedy algorithm (no preemptions used), is optimal for this model i.e. O(logm) competitive. However, for general precedence constraints, we show a lower bound of m which is easily matched by a greedy algorithm.
Research supported in part by the Israel Science Foundation and by the United States-Israel Binational Science Foundation (BSF).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Y. Azar, J. Naor, and R. Rom. The competitiveness of on-line assignments. Journal of Algorithms, 18(2):221–237, 1995. Also in Proc. 3rd ACM-SIAM SODA, 1992, pp. 203–210.
A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis Cambridge University Press, 1998.
E. Davis and J.M. Jaffe. Algorithms for scheduling tasks on unrelated processors. J. Assoc. Comput. Mach, 28:712–736, 1981.
L. Epstein. Lower bounds for on-line scheduling with precedence constraints on identical machines. In 1st Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX98), volume 1444 of LNCS, pages 89–98, 1998.
R.L. Graham. Bounds for certain multiprocessor anomalies. Bell System Technical Journal, 45:1563–1581, 1966.
R.L. Graham. Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math, 17:416–429, 1969.
J.M. Jaffe. Efficient scheduling of tasks without full use of processor resources. Theoretical Computer Science, 12:1–17, 1980.
J. Sgall. On-line scheduling. In A. Fiat and G. J. Woeginger, editors, Online Algorithms: The State of the Art, volume 1442 of LNCS, pages 196–231. Springer-Verlag, 1998.
D. B. Shmoys, J. Wein, and D. P. Williamson. Scheduling parallel machines on line. SIAM J. on Computing, 24:1313–1331, 1995.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Azar, Y., Epstein, L. (2000). On-Line Scheduling with Precedence Constraints. In: Algorithm Theory - SWAT 2000. SWAT 2000. Lecture Notes in Computer Science, vol 1851. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44985-X_15
Download citation
DOI: https://doi.org/10.1007/3-540-44985-X_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67690-4
Online ISBN: 978-3-540-44985-0
eBook Packages: Springer Book Archive