Makespan minimization for two parallel machines scheduling with a periodic availability constraint

A two parallel machines scheduling problem where one machine is periodically unavailable with the objective of minimizing makespan is considered. It is showed that the worst-case ratio of the classical LPT algorithm and the competitive ratio of the LS algorithm are 3/2 and 2, respectively, for the o...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Computers & operations research 2009-06, Vol.36 (6), p.1809-1812
Hauptverfasser:	Xu, Dehua, Cheng, Zhenmin, Yin, Yunqiang, Li, Hongxing
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Availability Exact sciences and technology Heuristic algorithm Inventory control, production control. Distribution Operational research and scientific management Operational research. Management science Optimization algorithms Parallel machine Production scheduling Scheduling Scheduling, sequencing Studies
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	A two parallel machines scheduling problem where one machine is periodically unavailable with the objective of minimizing makespan is considered. It is showed that the worst-case ratio of the classical LPT algorithm and the competitive ratio of the LS algorithm are 3/2 and 2, respectively, for the offline version and the online version of the problem.
ISSN:	0305-0548 1873-765X 0305-0548
DOI:	10.1016/j.cor.2008.05.001