The cμ rule revisited
- 1 March 1985
- journal article
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 17 (1), 237-238
- https://doi.org/10.2307/1427064
Abstract
The cμ rule is optimal for arbitrary arrival processes provided that the service times are geometric and the service discipline is preemptive.Keywords
This publication has 1 reference indexed in Scilit:
- Two competing queues with linear costs and geometric service requirements: the μc-rule is often optimalAdvances in Applied Probability, 1985