Zhang Guochuan

Guochuan Zhang

Information about the author Guochuan Zhang will soon be added to the site.
Found 15 papers in total
Approximation schemes for two‐machine flow shop scheduling with two agents
Approximation schemes for two‐machine flow shop scheduling with two agents
2012
In this paper we consider two‐machine flow shop scheduling with two agents. Two...
Scheduling with a minimum number of machines
Scheduling with a minimum number of machines
2009
We investigate the scheduling problem with release dates and deadlines on a minimum...
Hardness of lazy packing and covering
Hardness of lazy packing and covering
2009
We prove APX-hardness for the two problems maximum resource bin packing and lazy bin...
On lazy bureaucrat scheduling with common deadlines
On lazy bureaucrat scheduling with common deadlines
2008
Lazy bureaucrat scheduling is a new class of scheduling problems introduced by Arkin...
Online bin packing of fragile objects with application in cellular networks
Online bin packing of fragile objects with application in cellular networks
2007
We study a specific bin packing problem which arises from the channel assignment...
On-line scheduling of parallel jobs in a list
On-line scheduling of parallel jobs in a list
2007
We study an on-line parallel job scheduling problem, where jobs arrive one by one. A...
Maximizing the total profit of rectangles packed into a rectangle
Maximizing the total profit of rectangles packed into a rectangle
2007
We consider the following rectangle packing problem. Given a set of rectangles, each...
A 3-approximation algorithm for two-dimensional bin packing
A 3-approximation algorithm for two-dimensional bin packing
2005
In the classical two-dimensional bin packing problem one is asked to pack a set of...
Linear-time-approximation algorithms for bin packing
Linear-time-approximation algorithms for bin packing
2000
Simchi–Levi proved that the famous bin packing algorithms FF and BF have an...
Optimal on-line algorithms for variable-sized bin covering
Optimal on-line algorithms for variable-sized bin covering
1999
We deal with the variable-sized bin covering problem: Given a list L of items in (0,1]...
Minimizing makespan on a single batch processing machine with nonidentical job sizes
Minimizing makespan on a single batch processing machine with nonidentical job sizes
2001
We deal with the problem of minimizing makespan on a single batch processing machine....
On-line algorithms for minimizing makespan on batch processing machines
On-line algorithms for minimizing makespan on batch processing machines
2001
We consider the problem of scheduling jobs on-line on batch processing machines with...
On-line scheduling on two parallel machines where jobs arrive over time
On-line scheduling on two parallel machines where jobs arrive over time
2000
In this paper, we will consider a new on-line scheduling model on two parallel...
A constrained minimum spanning tree problem
A constrained minimum spanning tree problem
2000
In this paper, we give an O(n 2 ) algorithm for finding a point on a given line l...
A new approximation algorithm for unit execution time scheduling with chain-type precedence constraints
A new approximation algorithm for unit execution time scheduling with chain-type precedence constraints
1998
In this paper a new approximation algorithm with worst case performance ratio 3/2 is...
Papers per page: