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á bibliografia

Vydané v:	European journal of operational research
Hlavní autori:	Park, Insoo, Lee, Kangbok, Pinedo, Michael
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.09.2025
Predmet:	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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!