Optimal Operation of an M / G /1 Priority Queue with Removable Server

Colin E. Bell
Additional contact information
Colin E. Bell: University of California, Irvine, California

Operations Research, 1973, vol. 21, issue 6, 1281-1290

Abstract: An optimal operating policy is characterized for the infinite-horizon average-cost case of a queuing control problem with the following properties: N priority classes of customers each arriving according to an independent Poisson process, a holding charge of h i , per customer of class i per unit time, and a single server who provides independent identically distributed service times and who may be turned on at arrival epochs or off at departure epochs. The server costs w per unit time to operate and there are fixed charges of S 1 and S 2 for turning the server on and off, respectively. This paper shows that a stationary optimal policy exists that either (l) leaves the server on at all times or (2) turns the server off when the system is empty. In the latter case, if the state of the system is represented as a point in N -dimensional Euclidean space, the server is turned on at the first time that the state reaches a boundary and this boundary is a hyperplane of dimension N − 1.

Date: 1973
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.21.6.1281 (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:21:y:1973:i:6:p:1281-1290

Access Statistics for this article

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