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

A Multiserver Queue with Thresholds for the Acceptance of Customers into Service

Author

Listed:
  • Marcel F. Neuts

    (University of Delaware, Newark, Delaware)

  • R. Nadarajan

    (Annamalai University, Annamalainagar, India)

Abstract

A queue with Poisson arrivals is served by N identical exponential servers. When a server becomes free, a group of customers of size at most b can be served. The server is not allowed to process a group of size less than a , 1 ≤ a ≤ b . The actual size of each group served depends on the number of waiting customers. The queue is studied as a Markov process. In the stable case, the stationary probability vector of this process has a simple, readily computable form. Using this form, the stationary waiting time distribution, which is analytically intractable, may be expressed in an algorithmically useful form. Several questions, related to the optimal design of such a service system, may be algorithmically investigated. This model serves to illustrate the advantages of the algorithmic approach. The design criteria are not analytically tractable in general.

Suggested Citation

  • Marcel F. Neuts & R. Nadarajan, 1982. "A Multiserver Queue with Thresholds for the Acceptance of Customers into Service," Operations Research, INFORMS, vol. 30(5), pages 948-960, October.
    • Handle: RePEc:inm:oropre:v:30:y:1982:i:5:p:948-960
    DOI: 10.1287/opre.30.5.948
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.30.5.948
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.30.5.948?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. Fowler, John W. & Mönch, Lars, 2022. "A survey of scheduling with parallel batch (p-batch) processing," European Journal of Operational Research, Elsevier, vol. 298(1), pages 1-24.
    2. Warren B. Powell, 1987. "Waiting‐time distributions for bulk arrival, bulk service queues with vehicle‐holding and cancellation strategies," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(2), pages 207-227, April.
    3. S. Chakravarthy & Attahiru Sule Alfa, 1993. "A multiserver queue with markovian arrivals and group services with thresholds," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(6), pages 811-827, October.

    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:30:y:1982:i:5:p:948-960. 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.