Alternative algorithms for identical machines scheduling to maximize total early work with a common due date

We study a scheduling problem with a given number of identical parallel machines, a common job due date and the total early work criterion, i.e., Pm|dj=d|max{X}, which is known to be NP-hard. A new dynamic programming algorithm is proposed, which is more efficient than the existing exact approach fo...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Computers & industrial engineering Jg. 171; S. 108386
Hauptverfasser:	Chen, Xin, Shen, Xuefeng, Kovalyov, Mikhail Y., Sterna, Malgorzata, Blazewicz, Jacek
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Ltd 01.09.2022
Schlagworte:	Common due date Dynamic programming Early work maximization Fully polynomial time approximation scheme Identical machines scheduling Fully polynomial time approximation scheme Early work maximization Common due date Dynamic programming Identical machines scheduling
ISSN:	0360-8352, 1879-0550
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!