Performance guarantees of jump neighborhoods on restricted related parallel machines

We study the performance of two popular jump neighborhoods on the classical scheduling problem of minimizing the makespan on related parallel machines under the additional restriction that jobs are only allowed to be scheduled on a subset of machines. In particular, we analyze the performance guaran...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Operations research letters 2012-07, Vol.40 (4), p.287-291
Hauptverfasser:	Rutten, C., Recalde, D., Schuurman, P., Vredeveld, T.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences Approximation algorithms Computer science control theory systems Constrictions Exact sciences and technology Inventory control, production control. Distribution Jump neighborhoods Operational research and scientific management Operational research. Management science Operations research Performance guarantee Scheduling Scheduling on restricted machines Scheduling, sequencing Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	We study the performance of two popular jump neighborhoods on the classical scheduling problem of minimizing the makespan on related parallel machines under the additional restriction that jobs are only allowed to be scheduled on a subset of machines. In particular, we analyze the performance guarantee of local optima with respect to the jump and the lexicographical jump neighborhood.
ISSN:	0167-6377 1872-7468
DOI:	10.1016/j.orl.2012.04.002