@inproceedings{41aac1a36a1249fd8694447393c19afd,
title = "Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling",
abstract = "We consider the problem of minimizing the makespan on restricted related parallel machines. In restricted machine scheduling each job is only allowed to be scheduled on a subset of machines. We study the worst-case behavior of local search algorithms. In particular, we analyze the quality of local optima with respect to the jump, swap, push and lexicographical jump neighborhood.",
keywords = "local search, performance guarantee, restricted machines, eligibility constraints",
author = "D. Recalde and C. Rutten and P. Schuurman and T. Vredeveld",
year = "2010",
month = jan,
day = "1",
doi = "10.1007/978-3-642-12200-2_11",
language = "English",
isbn = "978-3-642-12199-9",
series = "Lecture Notes in Computer Science",
publisher = "Springer, Berlin, Heidelberg",
pages = "108--119",
editor = "A. L{\'o}pez-Ortiz",
booktitle = "LATIN 2010: Theoretical Informatics",
address = "Germany",
edition = "1",
note = "9th Latin American Symposium ; Conference date: 19-04-2010 Through 23-04-2010",
}