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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	European journal of operational research
Hauptverfasser:	Park, Insoo, Lee, Kangbok, Pinedo, Michael
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.09.2025
Schlagworte:	Approximation algorithm Flow shop Scheduling Scheduling with different machine speeds Scheduling with different machine speeds Scheduling Flow shop Approximation algorithm
ISSN:	0377-2217
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!