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

Full description

Bibliographic Details

Published in:	Discrete Applied Mathematics Vol. 377; pp. 390 - 401
Main Authors:	Dong, Jianming, Jin, Ruyan, Lin, Guohui, Su, Bing, Tong, Weitian, Xu, Yao
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 31.12.2025
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!