Article contents
Loading and Sequencing on Parallel Machines
Published online by Cambridge University Press: 27 July 2009
Abstract
We consider the problem of scheduling jobs on parallel machines to minimize flowtime, where all decisions about loading and sequencing must be made before any processing is done. We find policies that minimize flowtime stochastically or in the increasing convex sense under various assumptions.
- Type
- Articles
- Information
- Probability in the Engineering and Informational Sciences , Volume 6 , Issue 2 , April 1992 , pp. 193 - 199
- Copyright
- Copyright © Cambridge University Press 1992
References
- 1
- Cited by