Abstract
We give an algorithm to minimize the total completion time on-line on a single machine, using restarts, with a competitive ratio of 3/2. The optimal competitive ratio without using restarts is 2 for deterministic algorithms and e/(e —1)≈ 1.582 for randomized algorithms. This is the first restarting algorithm to minimize the total completion time that is proved to be better than an algorithm that does not restart.
Work supported by the Deutsche Forschungsgemeinschaft, Project AL 464/3-1, and by the European Community, Projects APPOL and APPOL II.
This is a preview of subscription content, log in via an institution to check access.
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
C. Chekuri, R. Motwani, B. Natarajan, and C. Stein. Approximation techniques for average completion time scheduling. In Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 609–618, New York / Philadelphia, 1997. ACM / SIAM.
Leah Epstein and Rob vanStee. Lower bounds for on-line single-machine scheduling.In Proc. 26th Symp. on Mathematical Foundations of Computer Science, volume 2136 of Lecture Notes in Computer Science, pages 338–350, 2001.
H. Hoogeveen, C. N. Potts, and G. J. Woeginger. On-line scheduling on a single machine: maximizing the number of early jobs. Operations Research Letters, 27:193–197, 2000.
J. A. Hoogeveen and A. P. A. Vestjens. Optimal on-line algorithms for single-machine scheduling. In W.H. Cunningham, S. T. McCormick, and M. Queyranne,editors, Integer Programming and Combinatorial Optimization, 5th International IPCO Conference, Proceedings, volume 1084 of Lecture Notes in Computer Science,pages 404–414. Springer, 1996.
C. A. Phillips, C. Stein, and J. Wein. Scheduling jobs that arrive over time. In Proceedings of the 4th Workshop on Al gorithms and Data Structures (WADS’95), volume 955 of Lecture Notes in Computer Science, pages 86–97. Springer, 1995.
David B. Shmoys, Joel Wein, and David P. Williamson. Scheduling parallel machines on-line. In Lyle A. McGeoch and Daniel D. Sleator, editors, On-line Algorithms, volume 7 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 163–166. AMS/ACM, 1991.
W. E. Smith. Various optimizers for single-stage production. Naval Research Logistics Quarterly, 3:59–66, 1956.
L. Stougie. Unpublished manuscript, 1995.
L. Stougie and A. P. A. Vestjens. Randomized on-line scheduling: How low can’t you go? Unpublished manuscript.
Marjan van den Akker, Han Hoogeveen, and Nodari Vakhania. Restarts can help in the on-line minimization of the maximum delivery time on a single machine. Journal of Scheduling, 3:333–341, 2000.
R. van Stee and J. A. La Poutré. Minimizing the total completion time on a single on-line machine, using restarts. Technical Report SEN-R0211, CWI, Amsterdam, June 2002.
Arjen P. A. Vestjens. On-line Machine Scheduling. PhD thesis, Eindhoven University of Technology, The Netherlands, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
van Stee, R., Outré, H.L. (2002). Minimizing the Total Completion Time On-line on a Single Machine, Using Restarts. In: Möhring, R., Raman, R. (eds) Algorithms — ESA 2002. ESA 2002. Lecture Notes in Computer Science, vol 2461. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45749-6_75
Download citation
DOI: https://doi.org/10.1007/3-540-45749-6_75
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44180-9
Online ISBN: 978-3-540-45749-7
eBook Packages: Springer Book Archive