Minimizing the Maximum Starting Time On-line

Authors:
Leah Epstein;Rob van Stee
Affiliations:
-;-
Venue:
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Year:
2002

Citing 8
Cited 0

New algorithms for an ancient scheduling problem

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A better algorithm for an ancient scheduling problem

Journal of Algorithms
Ancient and new algorithms for load balancing in the Lp norm

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Generating adversaries for request-answer games

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Speed is as powerful as clairvoyance

Journal of the ACM (JACM)
Scheduling in the dark

Theoretical Computer Science - Selected papers in honor of Manuel Blum
Maximizing Job Completions Online

ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Speed is more powerful than clairvoyance

Nordic Journal of Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.