Relevant Policies for Markovian Queueing Systems with Many Types of Service

Avraham Beja and Ariela Teller
Additional contact information
Avraham Beja: The Leon Recanati Graduate School of Business Administration, Tel-Aviv University
Ariela Teller: The Leon Recanati Graduate School of Business Administration, Tel-Aviv University

Management Science, 1975, vol. 21, issue 9, 1049-1054

Abstract: A single station service system with bounded queue capacity operates in discrete time, and at each period, one out of K possible service rates is used. A subclass of the stationary nonrandomized policies--termed relevant--which uses only a subset of the available service rates, is proved optimal for the average cost criterion. If there is some type of service whereby the expected cost per served customer is no more than the expense of losing him, the service rate in all relevant policies increases with the number of customers observed in the system; if there is no such type of service, the service rate in all relevant policies decreases with the number of observed customers.

Date: 1975
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.21.9.1049 (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:ormnsc:v:21:y:1975:i:9:p:1049-1054

Access Statistics for this article

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