Scheduling Groups of Unit Length Jobs on Two Identical Parallel Machines. - Zhaohui Liu 001; Wenci Yu; T. C. Edwin Cheng (Inf. Process. Lett., 1999)

Minimizing the Number of Late Jobs under the Group Technology Assumption. - Zhaohui Liu 001; Wenci Yu (J. Comb. Optim., 1999)

Scheduling one batch processor subject to job release dates. - Zhaohui Liu 001; Wenci Yu (Discret. Appl. Math., 2000)

Scheduling with job release dates, delivery times and preemption penalties. - Zhaohui Liu 001; T. C. Edwin Cheng (Inf. Process. Lett., 2002)

3/2-approximation for two-machine no-wait flowshop scheduling with availability constraints. - T. C. Edwin Cheng; Zhaohui Liu 001 (Inf. Process. Lett., 2003)

Approximability of two-machine no-wait flowshop scheduling with availability constraints. - T. C. Edwin Cheng; Zhaohui Liu 001 (Oper. Res. Lett., 2003)

On scheduling an unbounded batch machine. - Zhaohui Liu 001; Jinjiang Yuan; T. C. Edwin Cheng (Oper. Res. Lett., 2003)

On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times. - C. T. Ng 001; T. C. Edwin Cheng; Jinjiang Yuan; Zhaohui Liu 001 (Oper. Res. Lett., 2003)

Minimizing Total Completion Time Subject to Job Release Dates and Preemption Penalties. - Zhaohui Liu 001; T. C. Edwin Cheng (J. Sched., 2004)

The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan. - Jinjiang Yuan; Zhaohui Liu 001; C. T. Ng 001; T. C. Edwin Cheng (Theor. Comput. Sci., 2004)

Single machine scheduling to minimize total weighted tardiness. - T. C. Edwin Cheng; C. T. Ng 001; Jinjiang Yuan; Zhaohui Liu 001 (Eur. J. Oper. Res., 2005)

Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine. - Zhaohui Liu 001; T. C. Edwin Cheng (Theor. Comput. Sci., 2005)

Single machine batch scheduling problem with family setup times and release dates to minimize makespan. - Jinjiang Yuan; Zhaohui Liu 001; C. T. Ng 001; T. C. Edwin Cheng (J. Sched., 2006)

Vehicle routing problems on a line-shaped network with release time constraints. - Wei Yu 011; Zhaohui Liu 001 (Oper. Res. Lett., 2009)

Semi-online scheduling with known maximum job size on two uniform machines. - Qian Cao; Zhaohui Liu 001 (J. Comb. Optim., 2010)

Online scheduling with reassignment on two uniform machines. - Qian Cao; Zhaohui Liu 001 (Theor. Comput. Sci., 2010)

Routing open shop and flow shop scheduling problems. - Wei Yu 011; Zhaohui Liu 001; Leiyang Wang; Tijun Fan (Eur. J. Oper. Res., 2011)

Single-vehicle scheduling problems with release and service times on a line. - Wei Yu 011; Zhaohui Liu 001 (Networks, 2011)

Semi-online scheduling with known partial information about job sizes on two identical machines. - Qian Cao; Zhaohui Liu 001; T. C. Edwin Cheng (Theor. Comput. Sci., 2011)

An improved approximation algorithm for the clustered traveling salesman problem. - Xiaoguang Bao; Zhaohui Liu 001 (Inf. Process. Lett., 2012)

Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle. - Xiaoguang Bao; Zhaohui Liu 001 (Theor. Comput. Sci., 2012)

Single Machine Scheduling with batch Delivery to Multiple Customers in a Star-shaped Network. - Leiyang Wang; Zhaohui Liu 001 (Asia Pac. J. Oper. Res., 2013)

A theoretical development for the total tardiness problem and its application in branch and bound algorithms. - Shuyu Zhou; Zhaohui Liu 001 (Comput. Oper. Res., 2013)

Semi-online scheduling problems on two uniform machines under a grade of service provision. - Xinrong Lu; Zhaohui Liu 001 (Theor. Comput. Sci., 2013)

Optimal deterministic algorithms for some variants of Online Quota Traveling Salesman Problem. - Wei Yu 011; Zhaohui Liu 001; Xiaoguang Bao (Eur. J. Oper. Res., 2014)

Improved Approximation Algorithms for Min-Max and Minimum Vehicle Routing Problems. - Wei Yu 011; Zhaohui Liu 001 (COCOON, 2015)

Online Hierarchical Scheduling on Two Uniform Machines with Bounded Job Sizes. - Xinrong Lu; Zhaohui Liu 001 (Asia Pac. J. Oper. Res., 2015)

Online scheduling with equal processing times and machine eligibility constraints. - Jia Xu; Zhaohui Liu 001 (Theor. Comput. Sci., 2015)

Resource consumption minimization with a constraint of maximum tardiness on parallel machines. - Zhaohui Liu 001; Wen-Chiung Lee; Jen-Ya Wang (Comput. Ind. Eng., 2016)

An optimal online algorithm for fractional scheduling on uniform machines with three hierarchies. - Xinrong Lu; Zhaohui Liu 001 (J. Syst. Sci. Complex., 2016)

Semi-online scheduling with bounded job sizes on two uniform machines. - Qian Cao; Zhaohui Liu 001 (Theor. Comput. Sci., 2016)

Improved approximation algorithms for some min-max and minimum cycle cover problems. - Wei Yu 011; Zhaohui Liu 001 (Theor. Comput. Sci., 2016)

Better Inapproximability Bounds and Approximation Algorithms for Min-Max Tree/Cycle/Path Cover Problems. - Wei Yu 011; Zhaohui Liu 001 (COCOON, 2017)

A note on approximation algorithms of the clustered traveling salesman problem. - Xiaoguang Bao; Zhaohui Liu 001; Wei Yu 011; Ganggang Li (Inf. Process. Lett., 2017)

Distance Constrained Vehicle Routing Problem to Minimize the Total Cost. - Wei Yu 011; Zhaohui Liu 001; Xiaoguang Bao (COCOON, 2019)

Approximating the multiple-depot multiple-terminal Hamiltonian path problem. - Yichen Yang 007; Zhaohui Liu 001 (Discret. Optim., 2019)

Better approximability results for min-max tree/cycle/path cover problems. - Wei Yu 011; Zhaohui Liu 001 (J. Comb. Optim., 2019)

New approximation algorithms for the minimum cycle cover problem. - Wei Yu 011; Zhaohui Liu 001; Xiaoguang Bao (Theor. Comput. Sci., 2019)

Online fractional hierarchical scheduling on uniformly related machines. - Zhaohui Liu 001; Jiyuan Zhan (Comput. Oper. Res., 2020)

New LP relaxations for Minimum Cycle/Path/Tree Cover Problems. - Wei Yu 011; Zhaohui Liu 001; Xiaoguang Bao (Theor. Comput. Sci., 2020)

Approximation algorithms for some min-max postmen cover problems. - Wei Yu 011; Zhaohui Liu 001; Xiaoguang Bao (Ann. Oper. Res., 2021)

Approximation algorithms for some Minimum Postmen Cover Problems. - Yuying Mao; Wei Yu 011; Zhaohui Liu 001; Jiafeng Xiong (Discret. Appl. Math., 2022)

Approximation and polynomial algorithms for the data mule scheduling with handling time and time span constraints. - Wei Yu 011; Zhaohui Liu 001 (Inf. Process. Lett., 2022)

An asymptotically tight online algorithm for m-Steiner Traveling Salesman Problem. - Yubai Zhang; Zhao Zhang 002; Zhaohui Liu 001; Qirong Chen (Inf. Process. Lett., 2022)

Distance constrained vehicle routing problem to minimize the total cost: algorithms and complexity. - Wei Yu 011; Zhaohui Liu 001; Xiaoguang Bao (J. Comb. Optim., 2022)

The price of fairness for a two-agent scheduling game minimizing total completion time. - Yubai Zhang; Zhao Zhang 002; Zhaohui Liu 001 (J. Comb. Optim., 2022)

Approximation algorithms for the k-depots Hamiltonian path problem. - Yichen Yang 007; Zhaohui Liu 001; Wei Yu 011 (Optim. Lett., 2022)

Approximation algorithms for some min-max and minimum stacker crane cover problems. - Yuhui Sun; Wei Yu 011; Zhaohui Liu 001 (J. Comb. Optim., 2023)

Heuristics for Finding Sparse Solutions of Linear Inequalities. - Yichen Yang 007; Zhaohui Liu 001 (Asia Pac. J. Oper. Res., 2023)

Approximation Algorithms for the Minimum Weight Cycle/Path Partition Problem. - Yaqi Li; Wei Yu 011; Zhaohui Liu 001 (AAIM (1), 2024)

Approximation Algorithms for the Capacitated Min-Max and Minimum Graph Cover Problems. - Jiafeng Xiong; Zhaohui Liu 001; Wei Yu 011 (COCOA (1), 2024)

A local search algorithm for the k-path partition problem. - Shiming Li; Wei Yu 011; Zhaohui Liu 001 (Optim. Lett., 2024)

Approximation Algorithms for the Min-Max Mixed Rural Postmen Cover Problem and Its Variants. - Liting Huang; Wei Yu 011; Zhaohui Liu 001 (Algorithmica, 2024)

Improved approximation algorithms for the k-path partition problem. - Shiming Li; Wei Yu 011; Zhaohui Liu 001 (J. Glob. Optim., 2024)

Exact and approximation algorithms for the multi-depot data mule scheduling with handling time and time span constraints. - Minqin Liu; Wei Yu 011; Zhaohui Liu 001; Xinmeng Guo (J. Comb. Optim., 2025)

Approximating the maximum weight cycle/path partition in graphs with weights one and two. - Xinmeng Guo; Wei Yu 011; Zhaohui Liu 001 (J. Comb. Optim., 2025)