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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Discrete Applied Mathematics Ročník 195; s. 84 - 100
Hlavní autor: Etscheid, Michael
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 20.11.2015
Témata:
Local search
Performance guarantees
Scheduling
Smoothed analysis
Smoothed analysis
Local search
Scheduling
Performance guarantees
ISSN:0166-218X, 1872-6771
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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