Cai Xiaoqiang

Xiaoqiang Cai

Information about the author Xiaoqiang Cai will soon be added to the site.
Found 34 papers in total
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...
Asymmetric earliness and tardiness scheduling with exponential processing times on an unreliable machine
Asymmetric earliness and tardiness scheduling with exponential processing times on an unreliable machine
2000
We address the problem of processing a set of jobs on a single machine under random...
Time-varying minimum cost flow problems
Time-varying minimum cost flow problems
2001
In this paper, we study a minimum cost flow problem on a time-varying network. Let N (...
Time-varying shortest path problems with constraints
Time-varying shortest path problems with constraints
1997
We study a new version of the shortest path problem. Let G = (V, E) be a directed...
Portfolio optimization under a minimax rule
Portfolio optimization under a minimax rule
2000
This paper provides a new portfolio selection rule. The objective is to minimize the...
Stochastic scheduling on parallel machines subject to random breakdowns to minimize expected costs for earliness and tardy jobs
Stochastic scheduling on parallel machines subject to random breakdowns to minimize expected costs for earliness and tardy jobs
1999
This paper addresses a stochastic scheduling problem in which a set of independent...
A tight lower bound for the completion time variance problem
A tight lower bound for the completion time variance problem
1996
We consider the completion time variance problem. Our main result is a tight lower...
V-shape property for job sequences that minimize the expected completion time variance
V-shape property for job sequences that minimize the expected completion time variance
1996
We consider the problem of sequencing n jobs with random processing times on a single...
Minimizing total completion time in two-processor task systems with prespecified processor allocations
Minimizing total completion time in two-processor task systems with prespecified processor allocations
1998
We consider the problem of scheduling multiprocessor tasks with prespecified processor...
Papers per page: