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

Celý popis

Podrobná bibliografia

Vydané v:	Discrete Applied Mathematics Ročník 377; s. 390 - 401
Hlavní autori:	Dong, Jianming, Jin, Ruyan, Lin, Guohui, Su, Bing, Tong, Weitian, Xu, Yao
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 31.12.2025
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!