Cai X.

X. Cai

Information about the author X. Cai will soon be added to the site.
Found 11 papers in total
Cyclic job scheduling in paced assembly lines with cross-trained workers
Cyclic job scheduling in paced assembly lines with cross-trained workers
2007
Paced or synchronous assembly lines allow concurrent manufacturing of a mix of...
Minimax portfolio optimization: empirical numerical study
Minimax portfolio optimization: empirical numerical study
2004
In this paper, we carry out the empirical numerical study of the l ∞ portfolio...
Greedy heuristics for rapid scheduling of trains on a single track
Greedy heuristics for rapid scheduling of trains on a single track
1998
This paper describes the core algorithm used in an implementation of a scheduler...
A genetic algorithm for scheduling staff of mixed skills under multi-criteria
A genetic algorithm for scheduling staff of mixed skills under multi-criteria
2000
We consider the problem of scheduling staff with mixed skills. We formulate the...
Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem
Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem
1999
Scheduling a set of n jobs on a single machine so as to minimize the completion time...
Minimization of agreeably weighted variance in single machine systems
Minimization of agreeably weighted variance in single machine systems
1995
This paper considers the variance minimization problem with job-dependent weights. We...
Scheduling stochastic jobs with asymmetric earliness and tardiness penalties
Scheduling stochastic jobs with asymmetric earliness and tardiness penalties
1997
We consider a stochastic counterpart of the well-known earliness–tardiness...
Sequencing jobs with random processing times to minimize weighted completion time variance
Sequencing jobs with random processing times to minimize weighted completion time variance
1997
The authors examine the problem of sequencing a set of jobs on a single machine, where...
Scheduling jobs with random processing times on a single machine subject to stochastic breakdowns to minimize early-tardy penalties
Scheduling jobs with random processing times on a single machine subject to stochastic breakdowns to minimize early-tardy penalties
1996
The authors examine the problem of scheduling n jobs with a common due date on a...
A fast heuristic for the train scheduling problem
A fast heuristic for the train scheduling problem
1994
The train scheduling problem is an integer programming problem known to be NP hard. In...
On the complexity of completion time variance minimization problem
On the complexity of completion time variance minimization problem
1993
The complexity of the completion time variance problem has been open for a long time....
Papers per page: