Copyright © 1981 Published by Elsevier Science Ltd.
Optimal assignments in a markovian queueing system
Available online 20 May 2003.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
A generalization of the Hypercube queueing model for exponential queueing systems is presented which allows for distinguishable servers and multiple types of customers. Given costs associated with each server-customer pair, the determination of the assignment policy which minimizes time-averaged costs is formulated as a Markov decision problem. A characterization of optimal policies is obtained and used in an efficient algorithm for determining the optimum. The algorithm combines the method of successive approximations and “Howard's method” in a manner which is particularly applicable to Markov decision problems having large, sparse transition matrices.







E-mail Article
Add to my Quick Links

Cited By in Scopus (4)





