Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation

Authors:
Leah Epstein;Arik Ganot
Affiliations:
University of Haifa, Department of Mathematics, 31905, Haifa, Israel;Tel-Aviv University, School of Computer Science, Ramat-Aviv, 31905, Tel-Aviv, Israel
Venue:
Theory of Computing Systems
Year:
2008

Citing 0
Cited 1

Optimal online algorithms on two hierarchical machines with resource augmentation

COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the problem of on-line scheduling on two uniformly related machines where the on-line algorithm has resources different from those of the off-line algorithm. We consider three versions of this problem, preemptive semi-online, non-preemptive on-line and preemptive on-line scheduling. For all these cases we design algorithms with best possible competitive ratios as functions of the machine speeds.