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

Computation of Steady-State Probabilities for M / M /1 Priority Queues

Author

Listed:
  • Douglas R. Miller

    (The George Washington University, Washington, D.C.)

Abstract

Recursive computational formulas for the steady-state distributions of exponential single-server (preemptive and nonpreemptive) priority queues with two classes of customers are derived using Neuts’ theory of matrix-geometric invariant probability vectors.

Suggested Citation

  • Douglas R. Miller, 1981. "Computation of Steady-State Probabilities for M / M /1 Priority Queues," Operations Research, INFORMS, vol. 29(5), pages 945-958, October.
    • Handle: RePEc:inm:oropre:v:29:y:1981:i:5:p:945-958
    DOI: 10.1287/opre.29.5.945
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.29.5.945
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.29.5.945?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. Philip A. Ernst & Søren Asmussen & John J. Hasenbein, 2018. "Stability and busy periods in a multiclass queue with state-dependent arrival rates," Queueing Systems: Theory and Applications, Springer, vol. 90(3), pages 207-224, December.
    2. Amir Rastpour & Armann Ingolfsson & Burhaneddin Sandıkçı, 2022. "Algorithms for Queueing Systems with Reneging and Priorities Modeled as Quasi-Birth-Death Processes," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1693-1710, May.
    3. Jianfu Wang & Opher Baron & Alan Scheller-Wolf, 2015. "M/M/c Queue with Two Priority Classes," Operations Research, INFORMS, vol. 63(3), pages 733-749, June.
    4. Jayaswal, Sachin & Vidyarthi, Navneet, 2013. "Capacitated Multiple Allocation Hub Location with Service Level Constraints for Multiple Consignment Classes," IIMA Working Papers WP2013-11-02, Indian Institute of Management Ahmedabad, Research and Publication Department.
    5. Attahiru Sule Alfa & Bin Liu & Qi‐Ming He, 2003. "Discrete‐time analysis of MAP/PH/1 multiclass general preemptive priority queue," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(6), pages 662-682, September.
    6. William Liang & Barış Balcıog̃lu & Robert Svaluto, 2013. "Scheduling policies for a repair shop problem," Annals of Operations Research, Springer, vol. 211(1), pages 273-288, December.
    7. van Vianen, L.A. & Gabor, A.F. & van Ommeren, J.C.W., 2016. "Waiting times in classical priority queues via elementary lattice path counting," Econometric Institute Research Papers EI2016-17, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    8. Lars A. Vianen & Adriana F. Gabor & Jan-Kees Ommeren, 2016. "Waiting times in classical priority queues via elementary lattice path counting," Queueing Systems: Theory and Applications, Springer, vol. 84(3), pages 295-307, December.
    9. Jayaswal, Sachin & Vidyarthi, Navneet, 2023. "Multiple allocation hub location with service level constraints for two shipment classes," European Journal of Operational Research, Elsevier, vol. 309(2), pages 634-655.
    10. Drekic, Steve & Woolford, Douglas G., 2005. "A preemptive priority queue with balking," European Journal of Operational Research, Elsevier, vol. 164(2), pages 387-401, July.
    11. William P. Barnett & Daniel A. Levinthal, 2017. "Special Issue Introduction: Evolutionary Logics of Strategy and Organization," Strategy Science, INFORMS, vol. 2(1), pages 1-1, March.
    12. Jayaswal, Sachin & Jewkes, Elizabeth & Ray, Saibal, 2011. "Product differentiation and operations strategy in a capacitated environment," European Journal of Operational Research, Elsevier, vol. 210(3), pages 716-728, May.
    13. Jori Selen & Brian Fralix, 2017. "Time-dependent analysis of an M / M / c preemptive priority system with two priority classes," Queueing Systems: Theory and Applications, Springer, vol. 87(3), pages 379-415, December.
    14. Luyi Yang & Laurens Debo & Varun Gupta, 2017. "Trading Time in a Congested Environment," Management Science, INFORMS, vol. 63(7), pages 2377-2395, July.
    15. Winfried K. Grassmann & Steve Drekic, 2008. "Multiple Eigenvalues in Spectral Analysis for Solving QBD Processes," Methodology and Computing in Applied Probability, Springer, vol. 10(1), pages 73-83, March.

    More about this item

    Keywords

    698; 705 computation of steady-state probabilities for M/M1/PRI;

    JEL classification:

    Statistics

    Access and download statistics

    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:945-958. 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.