Performance guarantees for scheduling algorithms under perturbed machine speeds

We study two local search algorithms and a greedy algorithm for scheduling. The worst-case performance guarantees are well-known but seem to be contrived and too pessimistic for practical applications. For unrestricted machines, Brunsch et al. (2013) showed that the worst-case performance guarantees...

Full description

Saved in:
Bibliographic Details
Published in:Discrete Applied Mathematics Vol. 195; pp. 84 - 100
Main Author: Etscheid, Michael
Format: Journal Article
Language:English
Published: Elsevier B.V 20.11.2015
Subjects:
Local search
Performance guarantees
Scheduling
Smoothed analysis
Smoothed analysis
Local search
Scheduling
Performance guarantees
ISSN:0166-218X, 1872-6771
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We study two local search algorithms and a greedy algorithm for scheduling. The worst-case performance guarantees are well-known but seem to be contrived and too pessimistic for practical applications. For unrestricted machines, Brunsch et al. (2013) showed that the worst-case performance guarantees of these algorithms are not robust if the job sizes are subject to random noise. However, in the case of restricted related machines the worst-case bounds turned out to be robust even in the presence of random noise. We show that if the machine speeds rather than the job sizes are perturbed, one obtains smaller bounds for the performance guarantees also for restricted machines thus yielding a stronger result.
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2014.05.041