Article contents
Throughput maximization in a loss queueing system with heterogeneous servers
Published online by Cambridge University Press: 14 July 2016
Abstract
Assigning each arriving customer to the fastest idle server is shown to maximize throughput (equivalently, minimize blocking probability) in a queueing model with Poisson arrivals, heterogeneous exponential servers, and no waiting room. If a cost structure is imposed on this model, under specified conditions the same policy minimizes the expected discounted cost and the long-run average cost per unit time.
- Type
- Research Papers
- Information
- Copyright
- Copyright © Applied Probability Trust 1990
References
- 6
- Cited by