Interchange arguments for classical scheduling problems in queues
- 1 February 1989
- journal article
- research article
- Published by Elsevier in Systems & Control Letters
- Vol. 12 (2) , 177-184
- https://doi.org/10.1016/0167-6911(89)90011-x
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- K competing queues with geometric service requirements and linear costs: The μc-rule is always optimalSystems & Control Letters, 1985
- The cμ rule revisitedAdvances in Applied Probability, 1985
- Time-Sharing Service Systems. ITheory of Probability and Its Applications, 1975
- Dynamic Scheduling of a Multiclass Queue: Discount OptimalityOperations Research, 1975