Liu Zhaohui

Zhaohui Liu

Information about the author Zhaohui Liu will soon be added to the site.
Found 10 papers in total
Vehicle routing problems with regular objective functions on a path
Vehicle routing problems with regular objective functions on a path
2014
We investigate the problem of scheduling a fleet of vehicles to visit the customers...
A theoretical development for the total tardiness problem and its application in branch and bound algorithms
A theoretical development for the total tardiness problem and its application in branch and bound algorithms
2013
This paper deals with the single machine total tardiness problem, and proves that if...
Routing open shop and flow shop scheduling problems
Routing open shop and flow shop scheduling problems
2011
We consider a generalization of the classical open shop and flow shop scheduling...
Semi-online scheduling with known maximum job size on two uniform machines
Semi-online scheduling with known maximum job size on two uniform machines
2010
In this paper, we investigate the semi-online scheduling problem with known maximum...
Vehicle routing problems on a line-shaped network with release time constraints
Vehicle routing problems on a line-shaped network with release time constraints
2009
This work considers the vehicle routing problem on a line with the constraint that...
Minimizing total completion time subject to job release dates and preemption penalties
Minimizing total completion time subject to job release dates and preemption penalties
2004
Extensive research has been devoted to preemptive scheduling. However, little...
On scheduling an unbounded batch machine
On scheduling an unbounded batch machine
2003
A batch machine is a machine that can process up to c jobs simultaneously as a batch,...
Approximability of two-machine no-wait flowshop scheduling with availability constraints
Approximability of two-machine no-wait flowshop scheduling with availability constraints
2003
We consider in this paper the two-machine no-wait flowshop scheduling problem in which...
A note on the complexity of family scheduling to minimize the number of late jobs
A note on the complexity of family scheduling to minimize the number of late jobs
2001
The single-machine family scheduling problem of minimizing the number of late jobs has...
NP-hardness of some special cases of the three-machine flow-shop problem
NP-hardness of some special cases of the three-machine flow-shop problem
2000
In this paper, the authors investigate the computational complexity of some special...
Papers per page: