Flowshop problem F2 → D|v = 1, c ≥ 1|Cmax revisited. - Yan Lan; Xin Han; Yinling Wang 001; Min Ge; He Guo 001; Xin Chen 032 (Theor. Comput. Sci., 2017)

A New Approximation Algorithm for Flow Shop with Transporter Coordinate. - Xin Han; Yinling Wang 001 (NCTCS, 2018)

Weighted Throughput Maximization with Calibrations. - Vincent Chau; Shengzhong Feng; Minming Li; Yinling Wang 001; Guochuan Zhang; Yong Zhang 001 (WADS, 2019)

Minimizing the cost of batch calibrations. - Vincent Chau; Minming Li; Elaine Yinling Wang; Ruilong Zhang 001; Yingchao Zhao 001 (Theor. Comput. Sci., 2020)

Minimizing energy on homogeneous processors with shared memory. - Vincent Chau; Chi Kit Ken Fong; Shengxin Liu; Elaine Yinling Wang; Yong Zhang 001 (Theor. Comput. Sci., 2021)

A tight approximation algorithm for problem $P2 rightarrow D|v=1, c=1|C_{ max }$. - Yinling Wang 001; Yan Lan; Xin Chen 032; Xin Han; Yong Piao (J. Comb. Optim., 2022)

An improved approximation algorithm for a scheduling problem with transporter coordination. - Yinling Wang 001; Xin Han; Yong Zhang 001; Jacek Blazewicz (J. Sched., 2023)