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

Celý popis

Podrobná bibliografie

Vydáno v:	Computers & operations research Ročník 181; s. 107046
Hlavní autoři:	Mor, Baruch, Geng, Xin-Na
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier Ltd 01.09.2025
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!