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

M / G /1 Queues with Scheduling within Generations and Removable Server

Author

Listed:
  • J. G. Shanthikumar

    (University of Toronto, Toronto, Ontario, Canada)

Abstract

Two models of M / G /1 queues with removable server and scheduling within generations are considered in this paper. The scheduling policy considered here is the shortest processing time; the control policies are the multiple vacations policy and N -control policy. The Laplace-Stieltjes transforms of the waiting time distribution, the mean cost rates and the optimal control policies are derived for these two models. Properties of the delayed busy cycle are used in our analysis.

Suggested Citation

  • J. G. Shanthikumar, 1981. "M / G /1 Queues with Scheduling within Generations and Removable Server," Operations Research, INFORMS, vol. 29(5), pages 1010-1018, October.
    • Handle: RePEc:inm:oropre:v:29:y:1981:i:5:p:1010-1018
    DOI: 10.1287/opre.29.5.1010
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.29.5.1010
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.29.5.1010?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. J. George Shanthikumar, 1989. "Level crossing analysis of priority queues and a conservation identity for vacation models," Naval Research Logistics (NRL), John Wiley & Sons, vol. 36(6), pages 797-806, December.

    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:29:y:1981:i:5:p:1010-1018. 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.