We study the scheduling problem of minimizing the maximum starting time on-line. The goal is to minimize the last time that a job starts. We show that while the greedy algorithm has a competitive ratio of Θ(log m), we can give a constant competitive algorithm for this problem. We also show that the greedy algorithm is optimal for resource augmentation in the sense that it requires 2m - 1 machines to have a competitive ratio of 1, whereas no algorithm can achieve this with 2m - 2 machines.
Bibliographical noteFunding Information:
A preliminary version of this paper appeared in Proceedings of the 10th European Symposium on Algorithms (ESA 2002), p. 449–460. ∗ Corresponding author. Fax: +31 20 592 4199. E-mail addresses: email@example.com (L. Epstein), Rob.van.Stee@cwi.nl (R. van Stee). 1 This research was supported by Israel Science Foundation (Grant No. 250/01). 2 This research was supported by the Netherlands Organization for Scientific Research (NWO), Project No. SION 612-061-000.
ASJC Scopus subject areas
- Theoretical Computer Science
- Information Systems
- Computer Science Applications
- Computational Theory and Mathematics