The Complexity of Parallel Machine Scheduling of Unit-Processing-Time Jobs under Level-Order Precedence Constraints. - Tianyu Wang 005; Odile Bellenguez-Morineau (J. Sched., 2019)

A complexity analysis of parallel scheduling unit-time jobs with in-tree precedence constraints while minimizing the mean flow time. - Tianyu Wang 005; Odile Bellenguez-Morineau (J. Sched., 2019)

Three notes on scheduling unit-length jobs with precedence constraints to minimize the total completion time. - Tianyu Wang 005; Odile Bellenguez (J. Sched., 2021)

Minimizing Indirect Contacts in Urban Pick-Up and Delivery Services During COVID-19 Pandemic. - Tianyu Wang 005; Desheng Wu; Weizhi Zhao (IEEE Trans. Syst. Man Cybern. Syst., 2023)