You are here

K Competing Queues With Geometric Service Requirements and Linear Costs: The uc-rule is Always Optimal

Type: 
Journal ArticleArticles in refereed journals
Authored by:
Baras, John S., Ma, D -J., Makowski, Armand M.
Publication date:
August 1985
Journal:
Systems and Control Letters, Vol. 6, No. 3, pp. 173-180
Full Text Paper: 
Abstract: 

In this note, a discrete-time system of K competing queues with geometric service requirements and arbitrary arrival patterns is studied. When the cost per slot is linear in the queue sizes, it is shown that the µc-rule minimizes the expected discounted cost over the infinite horizon.