The k-splittable flow model and a heuristic algorithm for minimizing congestion in the MPLS networks. - Chengwen Jiao; Wenguo Yang; Suixiang Gao; Yinben Xia; Mingming Zhu (ICNC, 2014)

A Best Possible Online Algorithm for Scheduling to minimize Maximum Flow-Time on Bounded batch Machines. - Chengwen Jiao; Wenhua Li; Jinjiang Yuan (Asia Pac. J. Oper. Res., 2014)

Comparing Algorithms for Minimizing Congestion and Cost in the Multi-Commodity k-Splittable Flow. - Chengwen Jiao; Suixiang Gao; Wenguo Yang (Comput. Inf. Sci., 2015)

Online Algorithms for Scheduling Unit Length Jobs on Unbounded Parallel-Batch Machines with Linearly Lookahead. - Chengwen Jiao; Jinjiang Yuan; Qi Feng (Asia Pac. J. Oper. Res., 2019)

Parallel-machine scheduling with job-dependent cumulative deterioration effect and rejection. - Shi-Sheng Li; Ren-Xia Chen; Qi Feng; Chengwen Jiao (J. Comb. Optim., 2019)