Improved algorithm for minimizing total late work on a proportionate flow shop and extensions to job rejection and generalized due dates

Gerstl et al (2019) studied the problem of minimizing the total late work (TLW) on an m-machine proportionate flow shop. They solved the case where the total late work refers to the last operation of the job (i.e., the operation performed on the last machine of the flow shop). As the problem is know...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Computers & operations research Jg. 181; S. 107046
Hauptverfasser:	Mor, Baruch, Geng, Xin-Na
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Ltd 01.09.2025
Schlagworte:	Dynamic programming Generalized due dates Job rejection Proportionate flow shop Scheduling Total late work Scheduling Generalized due dates Dynamic programming Total late work Proportionate flow shop Job rejection
ISSN:	0305-0548
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!