Abstract
We present a deterministic online algorithm for scheduling two parallel machines when jobs arrive over time and show that it is \( (5 - \sqrt 5 )/2 \approx 1.38198\)-competitive. The best previously known algorithm is 3/2 -competitive. Our upper bound matches a previously known lower bound, and thus our algorithm has the best possible competitive ratio. We also present a lower bound of 1.21207 on the competitive ratio of any randomized online algorithm for any number of machines. This improves a previous result of \( 4 - 2\sqrt 2 ) \approx 1.17157\).
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
Albers, S. Better bounds for online scheduling. In Proceedings of the 29th ACM Symposium on Theory of Computing (1997), pp. 130–139.
Bartal, Y., Fiat, A., Karloff, H., and Vohra, R. New algorithms for an ancient scheduling problem. Journal of Computer and System Sciences 51,3 (Dec 1995), 359–366.
Bartal, Y., Karloff, H., and Rabani, Y. A better lower bound for on-line scheduling. Information Processing Letters 50,3 (May 1994), 113–116.
Chen, B., van Vliet, A., and Woeginger, G. A lower bound for randomized on-line scheduling algorithms. Information Processing Letters 51,5 (Sep 1994), 219–222.
Chen, B., van Vliet, A., and Woeginger, G. New lower and upper bounds for on-line scheduling. Operations Research Letters 16,4 (Nov 1994), 221–230.
CHEN, B., and VESTJENS, A. Scheduling on identical machines: How good is LPT in an online setting? Operations Research Letters 21,4 (Nov 1997), 165–169.
Faigle, U., Kern, W., and Turàan, G. On the performance of on-line algorithms for partition problems. Acta Cybernetica 9,2 (1989), 107–119.
Galambos, G., and Woeginger, G. An online scheduling heuristic with better worst case ratio than Graham’s list scheduling. SIAM Journal on Computing 22,2 (Apr 1993), 349–355.
Graham, R. L. Bounds for certain multiprocessing anomalies. Bell Systems Technical Journal 45 (1966), 1563–1581.
Hall, L., and Shmoys, D. Approximation schemes for constrained scheduling problems. In Proceedings of the 30th IEEE Symposium on Foundations of Computer Science (1989), pp. 134–139.
Karger, D., Phillips, S., and Torng, E. A better algorithm for an ancient scheduling problem. Journal of Algorithms 20,2 (Mar 1996), 400–430.
Karlin, A., Manasse, M., Rudolph, L., and Sleator, D. Competitive snoopy caching. Algorithmica 3,1 (1988), 79–119.
Reingold, N., Westbrook, J., and Sleator, D. Randomized competitive algorithms for the list update problem. Algorithmica 11,1 (Jan 1994), 15–32.
Seiden, S. S. Randomized algorithms for that ancient scheduling problem. In Proceedings of the 5th Workshop on Algorithms and Data Structures (Aug 1997), pp. 210–223.
Sgall, J. A lower bound for randomized on-line multiprocessor scheduling. Information Processing Letters 63,1 (Jul 1997), 51–55.
Shmoys, D., Wein, J., and Williamson, D. Scheduling parallel machines online. In Proceedings of the 32nd Symposium on Foundations of Computer Science (Oct 1991), pp. 131–140.
Sleator, D., and Tarjan, R. Amortized efficiency of list update and paging rules. Communications of the ACM 28,2 (Feb 1985), 202–208.
Stougie, L., and Vestjens, A. P. A. Randomized on-line scheduling: How low can’t you go? Manuscript, 1997.
Vestjens, A. P. A.On-line Machine Scheduling. PhD thesis, Eindhoven University of Technology, The Netherlands, 1997.
Von Neumann, J., and Morgenstern, O.Theory of games and economic behavior, 1st ed. Princeton University Press, 1944.
Yao, A. C. Probabilistic computations: Toward a unified measure of complexity. In Proceedings of the 18th IEEE Symposium on Foundations of Computer Science (1977), pp. 222–227.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Noga, J., Seiden, S. (1999). Scheduling Two Machines with Release Times. In: Cornuéjols, G., Burkard, R.E., Woeginger, G.J. (eds) Integer Programming and Combinatorial Optimization. IPCO 1999. Lecture Notes in Computer Science, vol 1610. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48777-8_29
Download citation
DOI: https://doi.org/10.1007/3-540-48777-8_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66019-4
Online ISBN: 978-3-540-48777-7
eBook Packages: Springer Book Archive