Randomized on-line scheduling on three processors

Authors:
Tomáš Tichý
Affiliations:
Mathematical Institute, AS CR, itná 25, CZ-11567 Praha 1, Czech Republic
Venue:
Operations Research Letters
Year:
2004

Citing 4
Cited 1

A lower bound for randomized on-line scheduling algorithms

Information Processing Letters
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 lower bound for randomized on-line multiprocessor scheduling

Information Processing Letters
An optimal algorithm for preemptive on-line scheduling

Operations Research Letters

Preemptive online scheduling: optimal algorithms for all speeds

ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a randomized on-line scheduling problem where each job has to be scheduled on any of m identical processors. The objective is to minimize the expected makespan. We show that the competitive ratio of any randomized algorithm for m=3 processors must be strictly greater than 2719.