IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v27y1981i10p1178-1187.html
   My bibliography  Save this article

Algorithms for the State Probabilities in a General Class of Single Server Queueing Systems with Group Arrivals

Author

Listed:
  • M. H. van Hoorn

    (Free University, IAWE, Amsterdam)

Abstract

Single server queues with batch arrivals are useful in the modeling of computer and communication systems amongst others. In this paper we give for a wide class of single server queues with batch arrivals a stable recursive method to compute state probabilities both at arrival and at arbitrary epochs. This class includes finite capacity models with state dependent Markovian input in which batches could be totally or partially rejected. The customers of a batch are served individually and the service time has a general distribution function. In particular, we discuss as application the computation of operating characteristics, such as rejection probability and probability of server idleness, for a finite capacity M/G/1 queue for which arriving customers are rejected if their waiting plus service times exceed the capacity of the system.

Suggested Citation

  • M. H. van Hoorn, 1981. "Algorithms for the State Probabilities in a General Class of Single Server Queueing Systems with Group Arrivals," Management Science, INFORMS, vol. 27(10), pages 1178-1187, October.
    • Handle: RePEc:inm:ormnsc:v:27:y:1981:i:10:p:1178-1187
    DOI: 10.1287/mnsc.27.10.1178
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.27.10.1178
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.27.10.1178?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
    ---><---

    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:ormnsc:v:27:y:1981:i:10:p:1178-1187. 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.