Abstract
We present a deterministic online algorithm for scheduling two parallel machines when jobs arrive over time and show that it is (5 − √5)/2 ≈ 1.38198-competitive. The best previously known algorithm is -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 ≈ 1.17157.
Cite
CITATION STYLE
Noga, J., & Seiden, S. (1999). Scheduling two machines with release times. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1610, pp. 391–399). Springer Verlag. https://doi.org/10.1007/3-540-48777-8_29
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
