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

Gespeichert in:
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!
Beschreibung
Zusammenfassung: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 the last operation of the job (i.e. the operation performed on the last machine of the flow shop); (ii) the case that total late work refers to all the operations (on all machines). Both versions are known to be NP-hard. We prove a crucial property of an optimal schedule, and consequently introduce efficient pseudo-polynomial dynamic programming algorithms for the two versions. The dynamic programming algorithms are tested numerically and proved to perform well on large size instances.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0020-7543
1366-588X
DOI:10.1080/00207543.2018.1456693