Abstract
We investigate the problem of on-line scheduling jobs on m identical parallel machines where preemption is allowed. The goal is to minimize the makespan. We derive an approximation algorithm with worst case guarantee m m/(m m −(m−1) m) for every m≥2, which increasingly tends to e/(e−1)≈1.58 as m→∞. Moreover, we prove that for no m≥2 there does exist any approximation algorithm with a better worst case guarantee.
Preview
Unable to display preview. Download preview PDF.
References
Bartal, Y., Fiat, A., Karloff, H., Vohra, R.: New algorithms for an ancient scheduling problem. Proc. 24th ACM Symposium on Theory of Computing (1992) 51–58
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco (1979)
McNaughton, R.: Scheduling with deadlines and loss functions, Management Sci. 6 (1959) 1–12
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, B., van Vliet, A., Woeginger, G.J. (1994). An optimal algorithm for preemptive on-line scheduling. In: van Leeuwen, J. (eds) Algorithms — ESA '94. ESA 1994. Lecture Notes in Computer Science, vol 855. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0049417
Download citation
DOI: https://doi.org/10.1007/BFb0049417
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58434-6
Online ISBN: 978-3-540-48794-4
eBook Packages: Springer Book Archive