Best-Possible Online Algorithms for Single Machine Scheduling to Minimize the Maximum Weighted Completion Time. - Xing Chai; Lingfa Lu; Wenhua Li; Liqi Zhang (Asia Pac. J. Oper. Res., 2018)

Online scheduling with chain precedence constraints of equal-length jobs on parallel machines to minimize makespan. - Xing Chai; Wenhua Li (J. Comb. Optim., 2018)

A best possible on-line algorithm for scheduling on uniform parallel-batch machines. - Wenhua Li; Xing Chai; Yali Song (Theor. Comput. Sci., 2018)

The medical laboratory scheduling for weighted flow-time. - Wenhua Li; Xing Chai (J. Comb. Optim., 2019)

Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine. - Xing Chai; Wenhua Li; Yuejuan Zhu (Ann. Oper. Res., 2021)

On-line scheduling with equal-length jobs on parallel-batch machines to minimise maximum flow-time with delivery times. - Ran Lin; Wenhua Li; Xing Chai (J. Oper. Res. Soc., 2021)

Online scheduling on a single machine with linear deteriorating processing times and delivery times. - Xing Chai; Wenhua Li; Hang Yuan; Libo Wang (J. Comb. Optim., 2022)

Approximation algorithms for batch scheduling with processing set restrictions. - Xing Chai; Wenhua Li; C. T. Ng 001; T. C. E. Cheng (J. Sched., 2023)