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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	International journal of production research Ročník 57; číslo 2; s. 531 - 543
Hlavní autori:	Gerstl, Enrique, Mor, Baruch, Mosheiov, Gur
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	London Taylor & Francis 17.01.2019 Taylor & Francis LLC
Predmet:	Algorithms combinatorial optimization Dynamic programming flow shop Job shops Polynomials Production scheduling Scheduling sequencing total late work
ISSN:	0020-7543, 1366-588X
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!