Yu Wenci

Wenci Yu

Information about the author Wenci Yu will soon be added to the site.
Found 7 papers in total
Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
2004
One of the first problems to be studied in scheduling theory was the problem of...
On-line scheduling algorithms for a batch machine with finite capacity
On-line scheduling algorithms for a batch machine with finite capacity
2005
We study the problem of on-line scheduling jobs with release dates on a batch machine...
On-line scheduling algorithms for a batch machine with finite capacity
On-line scheduling algorithms for a batch machine with finite capacity
2005
We study the problem of on-line scheduling jobs with release dates on a batch machine...
A flexible on-line scheduling algorithm for batch machine with infinite capacity
A flexible on-line scheduling algorithm for batch machine with infinite capacity
2005
We study on-line scheduling on a batch machine with infinite capacity. We present a...
The performance ratio of dense schedules for three machines open-shop with job's release date
The performance ratio of dense schedules for three machines open-shop with job's release date
2003
In this paper, the open-shop makespan problem with three machines, where jobs have two...
How good is a dense shop schedule?
How good is a dense shop schedule?
2001
In this paper, we study a class of simple and easy-to-construct shop schedules, known...
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: