Minimizing the maximum starting time on-line

Authors:
Leah Epstein;Rob van Stee
Affiliations:
School of Computer Science, The Interdisciplinary Center, Herzliya, Israel;Centre for Mathematics and Computer Science (CWI), Amsterdam, The Netherlands
Venue:
Information and Computation
Year:
2004

Citing 8
Cited 0

New algorithms for an ancient scheduling problem

Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
A better algorithm for an ancient scheduling problem

Journal of Algorithms
Better Bounds for Online Scheduling

SIAM Journal on Computing
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
Speed is more powerful than clairvoyance

Nordic Journal of Computing
Maximizing job completions online

Journal of Algorithms

Quantified Score

Hi-index	0.00

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 @Q(logm), 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.