Zhang Yuzhong

Yuzhong Zhang

Information about the author Yuzhong Zhang will soon be added to the site.
Found 9 papers in total
The NP-hardness of minimizing the total late work on an unbounded batch machine
2009
We consider the problem of minimizing the total late work (SUM V j ) on an unbounded...
Scheduling jobs with non-identical sizes on parallel batch processors
2005
The authors consider the problems of scheduling jobs with non-identical capacity...
Minimizing the total weighted completed time on batch processing machines
2005
In this paper, we study the problem of minimizing the total weighted completed time on...
Semi on-line scheduling for maximising the minimum machine completion time on two machines with available time
2004
In this paper, we consider two semi on-line scheduling problems on two machine...
Minimizing mean completion time in a batch processing system
2004
We consider batch processing jobs to minimize the mean completion time. A batch...
On-line and semi-on-line scheduling on uniform machines with non-simultaneous machine available times
2003
This paper investigates on-line and semi-on-line scheduling problems on uniform...
Approximation algorithms in batch processing
2003
A polynomial approximation scheme for minimizing makespan in a batch processing system...
On-line preemptive scheduling on uniform machines
2001
We address the problem of preemptively scheduling on-line jobs on a set of m arbitrary...
The complexity of a single batch processing machine in the case of two arrival times and a 2-approximation algorithm
2000
In this paper, the problem of minimizing the total completion time on a single batch...
Papers per page: