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

M/G/1//N Queues with Server Vacations and Exhaustive Service

Author

Listed:
  • Hideaki Takagi

    (University of Tsukuba, Ibaraki, Japan)

Abstract

Queues with a finite population of customers and occasional periods (called vacations) when the server is unavailable appear in many engineering systems, but have not been studied. In this paper, we specifically consider an M / G /1// N queueing system in which the server takes repeated vacations each time it has emptied the queue, until it finds a customer waiting. For the steady state, we show that performance measures such as the system throughput and mean response time can be obtained from the known analysis of a regenerative cycle of busy and vacation periods. We then study the joint distribution of the server state, the queue size, and the remaining service or vacation time at an arbitrary point in time for certain initial conditions. In the steady state, we explicitly obtain the distributions of the unfinished work, the virtual waiting time, and the real waiting time. The mean response times in several other vacation models are also provided.

Suggested Citation

  • Hideaki Takagi, 1994. "M/G/1//N Queues with Server Vacations and Exhaustive Service," Operations Research, INFORMS, vol. 42(5), pages 926-939, October.
    • Handle: RePEc:inm:oropre:v:42:y:1994:i:5:p:926-939
    DOI: 10.1287/opre.42.5.926
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.42.5.926
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.42.5.926?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. Wojciech M. Kempa, 2016. "Transient workload distribution in the $$M/G/1$$ M / G / 1 finite-buffer queue with single and multiple vacations," Annals of Operations Research, Springer, vol. 239(2), pages 381-400, April.

    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:42:y:1994:i:5:p:926-939. 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.