Scheduling on a proportionate flowshop to minimise total late work

We study a scheduling problem to minimise total late work, i.e. each job is penalised according to the duration of its parts scheduled after its due-date. The machine setting is an m-machine proportionate flow shop. Two versions of the problem are studied: (i) the case that total late work refers to...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	International journal of production research Jg. 57; H. 2; S. 531 - 543
Hauptverfasser:	Gerstl, Enrique, Mor, Baruch, Mosheiov, Gur
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	London Taylor & Francis 17.01.2019 Taylor & Francis LLC
Schlagworte:	Algorithms combinatorial optimization Dynamic programming flow shop Job shops Polynomials Production scheduling Scheduling sequencing total late work
ISSN:	0020-7543, 1366-588X
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!