Structure of Optimal Policies in Complex Queuing Systems

S. Christian Albright
Additional contact information
S. Christian Albright: Indiana University, Bloomington, Indiana

Operations Research, 1977, vol. 25, issue 6, 1020-1027

Abstract: This paper examines a class of M / G / S queuing reward systems with heterogeneous servers and heterogeneous customers. With the help of two simple results, we show that the policy that maximizes average reward per unit time over an infinite horizon possesses a certain structured form, which for several examples is quite intuitive and for others is not so intuitive. We also show that when the policy improvement method is used to find the optimal policy, only policies with the structured form need be considered, an obvious computational simplification. Computational results are discussed briefly.

Date: 1977
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.25.6.1020 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:25:y:1977:i:6:p:1020-1027

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().