Competitive ratio of List Scheduling on uniform machines and randomized heuristics

Authors:
Antoine Musitelli;Jean-Marc Nicoletti
Affiliations:
Dipartimento di Matematica pura ed applicata, Università degli Studi di Padova, Padova, Italy 35121;ROSO/IMA, EPFL, Lausanne, Switzerland 1015
Venue:
Journal of Scheduling
Year:
2011

Citing 5
Cited 2

Competitive paging with locality of reference

Selected papers of the 23rd annual ACM symposium on Theory of computing
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)
Approximation algorithms for NP-hard problems

Approximation algorithms for NP-hard problems
An On-Line Algorithm for Some Uniform Processor Scheduling

SIAM Journal on Computing
A new algorithm for online uniform-machine scheduling to minimize the makespan

Information Processing Letters

Online scheduling on uniform machines with two hierarchies

Journal of Combinatorial Optimization
Lower bounds for online makespan minimization on a small number of related machines

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study online scheduling on m uniform machines, where m驴1 of them have a reference speed 1 and the last one a speed s with 0驴s驴1. The competitive ratio of the well-known List Scheduling (LS) algorithm is determined. For some values of s and m=3, LS is proven to be the best deterministic algorithm. We describe a randomized heuristic for m machines. Finally, for the case m=3, we develop and analyze the competitive ratio of a randomized algorithm which outperforms LS for any s.