IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v21y1973i6p1281-1290.html
   My bibliography  Save this article

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

Author

Listed:
  • Colin E. Bell

    (University of California, Irvine, California)

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.

Suggested Citation

  • Colin E. Bell, 1973. "Optimal Operation of an M / G /1 Priority Queue with Removable Server," Operations Research, INFORMS, vol. 21(6), pages 1281-1290, December.
    • Handle: RePEc:inm:oropre:v:21:y:1973:i:6:p:1281-1290
    DOI: 10.1287/opre.21.6.1281
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.21.6.1281
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.21.6.1281?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Offer Kella, 1989. "The threshold policy in the M/G/1 queue with server vacations," Naval Research Logistics (NRL), John Wiley & Sons, vol. 36(1), pages 111-123, February.
    2. R. E. Lillo, 2000. "Optimal Operating Policy for an M/G/1 Exhaustive Server-Vacation Model," Methodology and Computing in Applied Probability, Springer, vol. 2(2), pages 153-167, August.
    3. R.E. Lillo, 2001. "Optimal control of an M/G/1 queue with impatient priority customers," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(3), pages 201-209, April.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:21:y:1973:i:6:p:1281-1290. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.