Article contents
A Note on One-Machine Scheduling Problems with Imperfect Information
Published online by Cambridge University Press: 27 July 2009
Abstract
In this paper we consider one-machine scheduling problems with or without a perfect machine and random processing times and derive among other results elimination criteria for different classes of cost functions.
- Type
- Articles
- Information
- Probability in the Engineering and Informational Sciences , Volume 5 , Issue 3 , July 1991 , pp. 317 - 331
- Copyright
- Copyright © Cambridge University Press 1991
References
REFERENCES
- 3
- Cited by