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

Waiting and Interdeparture Times in Priority Queues with Poisson- and General-Arrival Streams

Author

Listed:
  • David A. Stanford

    (The University of Western Ontario, London, Ontario, Canada)

Abstract

This paper presents new results for the interdeparture time distributions in single-server priority queues with an arbitrary number of high-priority Poisson-arrival classes and one lowest-priority general-arrival class. Little-known results for the waiting time distributions in the same queue are presented, including a new proof for the powerful result that the waiting time distribution in the non-preemptive priority queue is insensitive to the interarrival time distributions of lower-priority classes, beyond their mean.

Suggested Citation

  • David A. Stanford, 1997. "Waiting and Interdeparture Times in Priority Queues with Poisson- and General-Arrival Streams," Operations Research, INFORMS, vol. 45(5), pages 725-735, October.
    • Handle: RePEc:inm:oropre:v:45:y:1997:i:5:p:725-735
    DOI: 10.1287/opre.45.5.725
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.45.5.725
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.45.5.725?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. Sagnika Sen & T. S. Raghu & Ajay Vinze, 2009. "Demand Heterogeneity in IT Infrastructure Services: Modeling and Evaluation of a Dynamic Approach to Defining Service Levels," Information Systems Research, INFORMS, vol. 20(2), pages 258-276, June.
    2. Sofian De Clercq & Joris Walraevens, 2020. "Delay analysis of a two-class priority queue with external arrivals and correlated arrivals from another node," Annals of Operations Research, Springer, vol. 293(1), pages 57-72, October.
    3. Walraevens, Joris & Fiems, Dieter & Wittevrongel, Sabine & Bruneel, Herwig, 2009. "Calculation of output characteristics of a priority queue through a busy period analysis," European Journal of Operational Research, Elsevier, vol. 198(3), pages 891-898, November.
    4. Ananth V. Iyer & Apurva Jain, 2004. "Modeling the Impact of Merging Capacity in Production-Inventory Systems," Management Science, INFORMS, vol. 50(8), pages 1082-1094, August.
    5. Steve Drekic & David A. Stanford, 2001. "Reducing Delay in Preemptive Repeat Priority Queues," Operations Research, INFORMS, vol. 49(1), pages 145-156, February.

    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:45:y:1997:i:5:p:725-735. 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.