Zhaohui Liu
Orcid: 0000-0003-1215-7622Affiliations:
- East China University of Science and Technology, Department of Mathematics, Shanghai, China
According to our database1,
Zhaohui Liu
authored at least 54 papers
between 1999 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
J. Glob. Optim., December, 2024
Approximation Algorithms for the Min-Max Mixed Rural Postmen Cover Problem and Its Variants.
Algorithmica, April, 2024
Optim. Lett., January, 2024
Proceedings of the Algorithmic Aspects in Information and Management, 2024
2023
Asia Pac. J. Oper. Res., February, 2023
J. Comb. Optim., 2023
Exact and Approximation Algorithms for the Multi-depot Data Mule Scheduling with Handling Time and Time Span Constraints.
Proceedings of the Combinatorial Optimization and Applications, 2023
2022
Optim. Lett., 2022
The price of fairness for a two-agent scheduling game minimizing total completion time.
J. Comb. Optim., 2022
Distance constrained vehicle routing problem to minimize the total cost: algorithms and complexity.
J. Comb. Optim., 2022
An asymptotically tight online algorithm for <i>m</i>-Steiner Traveling Salesman Problem.
Inf. Process. Lett., 2022
Approximation and polynomial algorithms for the data mule scheduling with handling time and time span constraints.
Inf. Process. Lett., 2022
Discret. Appl. Math., 2022
2021
Ann. Oper. Res., 2021
2020
Theor. Comput. Sci., 2020
Comput. Oper. Res., 2020
2019
Theor. Comput. Sci., 2019
J. Comb. Optim., 2019
Discret. Optim., 2019
Proceedings of the Computing and Combinatorics - 25th International Conference, 2019
2017
Inf. Process. Lett., 2017
Better Inapproximability Bounds and Approximation Algorithms for Min-Max Tree/Cycle/Path Cover Problems.
Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017
2016
Theor. Comput. Sci., 2016
Theor. Comput. Sci., 2016
An optimal online algorithm for fractional scheduling on uniform machines with three hierarchies.
J. Syst. Sci. Complex., 2016
Resource consumption minimization with a constraint of maximum tardiness on parallel machines.
Comput. Ind. Eng., 2016
2015
Theor. Comput. Sci., 2015
Asia Pac. J. Oper. Res., 2015
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015
2014
Optimal deterministic algorithms for some variants of Online Quota Traveling Salesman Problem.
Eur. J. Oper. Res., 2014
2013
Semi-online scheduling problems on two uniform machines under a grade of service provision.
Theor. Comput. Sci., 2013
A theoretical development for the total tardiness problem and its application in branch and bound algorithms.
Comput. Oper. Res., 2013
Single Machine Scheduling with batch Delivery to Multiple Customers in a Star-shaped Network.
Asia Pac. J. Oper. Res., 2013
2012
Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle.
Theor. Comput. Sci., 2012
Inf. Process. Lett., 2012
2011
Semi-online scheduling with known partial information about job sizes on two identical machines.
Theor. Comput. Sci., 2011
Networks, 2011
2010
Theor. Comput. Sci., 2010
J. Comb. Optim., 2010
2009
Oper. Res. Lett., 2009
2006
Single machine batch scheduling problem with family setup times and release dates to minimize makespan.
J. Sched., 2006
2005
Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine.
Theor. Comput. Sci., 2005
Eur. J. Oper. Res., 2005
2004
The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan.
Theor. Comput. Sci., 2004
Minimizing Total Completion Time Subject to Job Release Dates and Preemption Penalties.
J. Sched., 2004
2003
On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times.
Oper. Res. Lett., 2003
Approximability of two-machine no-wait flowshop scheduling with availability constraints.
Oper. Res. Lett., 2003
3/2-approximation for two-machine no-wait flowshop scheduling with availability constraints.
Inf. Process. Lett., 2003
2002
Inf. Process. Lett., 2002
2000
Discret. Appl. Math., 2000
1999
J. Comb. Optim., 1999
Inf. Process. Lett., 1999