Performance Guarantees of Local Search for Multiprocessor Scheduling

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.

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Schuurman, Petra, Vredeveld, Tjark
Format:	Buchkapitel
Sprache:	eng
Schlagworte:	Applied sciences Exact sciences and technology Operational research and scientific management Operational research. Management science Scheduling, sequencing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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.
ISSN:	0302-9743 1611-3349
DOI:	10.1007/3-540-45535-3_29