ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Computers & Operations Research
Volume 8, Issue 1, 1981, Pages 17-23
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (653 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
Special issue
View Record in Scopus
 
doi:10.1016/0305-0548(81)90028-9    How to Cite or Link Using DOI (Opens New Window)
Copyright © 1981 Published by Elsevier Science Ltd.

Optimal assignments in a markovian queueing system

James P. Jarvis*

College of Sciences, Department of Mathematical Sciences, Clemson University, Clemson, SC 29631, U.S.A.

Available online 20 May 2003.

Purchase the full-text article



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.

Article Outline

• References

 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.