6 citations · 11 across the 8 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.DS2022
An efficient polynomial-time approximation scheme for parallel multi-stage open shops
Jianming Dong, Ruyan Jin, Guohui Lin +3
Various new scheduling problems have been arising from practical production processes and spawning new research areas in the scheduling field. We study the parallel multi-stage ope…
cs.DS2022★ 6 cited
A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint
Weitian Tong, Yao Xu, Huili Zhang
As a hybrid of the Parallel Two-stage Flowshop problem and the Multiple Knapsack problem, we investigate the scheduling of parallel two-stage flowshops under makespan constraint, w…