We study the schedulingproblem of minimizing the maximum startingtime 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.
CITATION STYLE
Epstein, L., & Van Stee, R. (2002). Minimizing the maximum starting time on-line. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2461, pp. 449–460). Springer Verlag. https://doi.org/10.1007/3-540-45749-6_41
Mendeley helps you to discover research relevant for your work.