A flow shop scheduling problem with machine-dependent speeds: An ensemble approach with worst-case analysis

We consider a flow shop scheduling problem to minimize the total weighted completion time with any given job having the same processing requirement at all stages and each machine operating at its own speed. This problem is known to be NP-hard even for just two machines. In this paper, we propose a s...

Celý popis

Podrobná bibliografie

Vydáno v:	European journal of operational research
Hlavní autoři:	Park, Insoo, Lee, Kangbok, Pinedo, Michael
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier B.V 01.09.2025
Témata:	Approximation algorithm Flow shop Scheduling Scheduling with different machine speeds Scheduling with different machine speeds Scheduling Flow shop Approximation algorithm
ISSN:	0377-2217
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!