Two-machine flow shop scheduling with a common due date to maximize total early work

•Two-machine ow shop scheduling to maximize total early work is considered.•A dynamic programming approach running in O(n2d2) time is proposed.•A fully polynomial time approximation scheme (FPTAS) is developed.•The approximation results work for the weighted model - if a specific constraint is satis...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	European journal of operational research Jg. 300; H. 2; S. 504 - 511
Hauptverfasser:	Chen, Xin, Miao, Qian, Lin, Bertrand M.T., Sterna, Malgorzata, Blazewicz, Jacek
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 16.07.2022
Schlagworte:	Combinatorial optimization Dynamic programming Early and late work Flow shop scheduling FPTAS Early and late work Dynamic programming Combinatorial optimization FPTAS Flow shop scheduling
ISSN:	0377-2217, 1872-6860
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!