@article {
	title = {K Competing Queues With Geometric Service Requirements and Linear Costs: The uc-rule is Always Optimal},
	author = {Baras, John S., Ma, D -J., Makowski, Armand M.},
	year = {1985},
	month = {08/1985},
	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 {\textmu}c-rule minimizes the expected discounted cost over the infinite horizon.},
	pages = {pp. 173-180},
	volume = {Vol. 6},
	number = {No. 3},
	journal = {Systems and Control Letters}
}
