Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date

•Fully polynomial time approximation scheme for early work maximization is proposed.•The new FPTAS dominates PTAS for the two-machine case known from the literature.•Complexity of parallel machine scheduling problems with common due date is studied.•Theoretical studies are completed with computation...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	European journal of operational research Jg. 284; H. 1; S. 67 - 74
Hauptverfasser:	Chen, Xin, Liang, Yage, Sterna, Małgorzata, Wang, Wen, Błażewicz, Jacek
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.07.2020
Schlagworte:	Early work Fully polynomial time approximation scheme Late work Parallel identical machines Scheduling Fully polynomial time approximation scheme Late work Scheduling Early work Parallel identical machines
ISSN:	0377-2217, 1872-6860
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!