Performance Guarantees of Local Search for Multiprocessor Scheduling

P. Schuurman; T. Vredeveld

doi:10.1007/3-540-45535-3_29

Performance Guarantees of Local Search for Multiprocessor Scheduling

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceeding › Academic › peer-review

Abstract

This paper deals with the worst-case performance of local search algorithms for makespan minimization on parallel machines. We analyze the quality of the local optima obtained by iterative improvements over the jump, the swap, and the newly defined push neighborhood.

Original language	English
Title of host publication	Integer Programming and Combinatorial Optimization. IPCO 2001
Editors	K. Aardal, B. Gerards
Publisher	Springer, Berlin, Heidelberg
Pages	370-382
ISBN (Electronic)	978-3-540-45535-6
ISBN (Print)	978-3-540-42225-9
DOIs	https://doi.org/10.1007/3-540-45535-3_29
Publication status	Published - 21 Jun 2001

Publication series

Series	Lecture Notes in Computer Science
Volume	2081
ISSN	0302-9743

Access to Document

10.1007/3-540-45535-3_29

Cite this

@inproceedings{6a7f650c852542fe81b619d6b15f7d94,

title = "Performance Guarantees of Local Search for Multiprocessor Scheduling",

abstract = "This paper deals with the worst-case performance of local search algorithms for makespan minimization on parallel machines. We analyze the quality of the local optima obtained by iterative improvements over the jump, the swap, and the newly defined push neighborhood.",

author = "P. Schuurman and T. Vredeveld",

year = "2001",

month = jun,

day = "21",

doi = "10.1007/3-540-45535-3_29",

language = "English",

isbn = "978-3-540-42225-9",

series = "Lecture Notes in Computer Science",

publisher = "Springer, Berlin, Heidelberg",

pages = "370--382",

editor = "K. Aardal and B. Gerards",

booktitle = "Integer Programming and Combinatorial Optimization. IPCO 2001",

address = "Germany",

}

Performance Guarantees of Local Search for Multiprocessor Scheduling. / Schuurman, P.; Vredeveld, T.
Integer Programming and Combinatorial Optimization. IPCO 2001. ed. / K. Aardal; B. Gerards. Springer, Berlin, Heidelberg, 2001. p. 370-382 (Lecture Notes in Computer Science, Vol. 2081).

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceeding › Academic › peer-review

TY - GEN

T1 - Performance Guarantees of Local Search for Multiprocessor Scheduling

AU - Schuurman, P.

AU - Vredeveld, T.

PY - 2001/6/21

Y1 - 2001/6/21

N2 - This paper deals with the worst-case performance of local search algorithms for makespan minimization on parallel machines. We analyze the quality of the local optima obtained by iterative improvements over the jump, the swap, and the newly defined push neighborhood.

AB - This paper deals with the worst-case performance of local search algorithms for makespan minimization on parallel machines. We analyze the quality of the local optima obtained by iterative improvements over the jump, the swap, and the newly defined push neighborhood.

U2 - 10.1007/3-540-45535-3_29

DO - 10.1007/3-540-45535-3_29

M3 - Conference article in proceeding

SN - 978-3-540-42225-9

T3 - Lecture Notes in Computer Science

SP - 370

EP - 382

BT - Integer Programming and Combinatorial Optimization. IPCO 2001

A2 - Aardal, K.

A2 - Gerards, B.

PB - Springer, Berlin, Heidelberg

ER -