An efficient polynomial-time approximation scheme for parallel multi-stage open shops

Various new scheduling problems have been arising from real-world applications and spawning new research areas in the scheduling field. We study the parallel multi-stage open shops problem, which generalizes the classic open shop scheduling and parallel machine scheduling problems. Given m identical...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete Applied Mathematics Jg. 377; S. 390 - 401
Hauptverfasser:	Dong, Jianming, Jin, Ruyan, Lin, Guohui, Su, Bing, Tong, Weitian, Xu, Yao
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 31.12.2025
Schlagworte:	Efficient polynomial-time approximation scheme Linear programming Makespan Parallel multi-stage open shops Scheduling Linear programming Scheduling Makespan Efficient polynomial-time approximation scheme Parallel multi-stage open shops
ISSN:	0166-218X
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!