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

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!