6 citations · 6 across the 3 of their papers we have counts for
3 papers
cs.DS2026
Cross-Shift Analysis for Unrelated-Machine Weighted Completion Time A (1.3168+epsilon)-Approximation
Weitian Tong, Yao Xu
We study the problem of minimizing total weighted completion time on unrelated parallel machines with machine-independent job weights. The best previous approximation guarantee for…
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…