IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v118y1999i1p181-193.html
   My bibliography  Save this article

Analysis of nonpreemptive priority queues with multiple servers and two priority classes

Author

Listed:
  • Kao, Edward P. C.
  • Wilson, Sandra D.

Abstract

No abstract is available for this item.

Suggested Citation

  • Kao, Edward P. C. & Wilson, Sandra D., 1999. "Analysis of nonpreemptive priority queues with multiple servers and two priority classes," European Journal of Operational Research, Elsevier, vol. 118(1), pages 181-193, October.
    • Handle: RePEc:eee:ejores:v:118:y:1999:i:1:p:181-193
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(98)00280-X
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Blanc, J.P.C. & van der Mei, R.D., 1992. "Optimization of polling systems by means of gradient methods and the power-series algorithm," Other publications TiSEM 137db514-d6fc-4ca3-a252-6, Tilburg University, School of Economics and Management.
    2. Blanc, J.P.C., 1990. "Performance evaluation of polling systems by means of the power-series algorithm," Other publications TiSEM a5f5fb56-c17c-4c46-8d5e-b, Tilburg University, School of Economics and Management.
    3. Blanc, J.P.C., 1993. "Performance Analysis and Optimization with the Power- Series Algorithm," Papers 9347, Tilburg - Center for Economic Research.
    4. Edward P. C. Kao & Kumar S. Narayanan, 1990. "Computing Steady-State Probabilities of a Nonpreemptive Priority Multiserver Queue," INFORMS Journal on Computing, INFORMS, vol. 2(3), pages 211-218, August.
    5. Winfried K. Grassmann & Michael I. Taksar & Daniel P. Heyman, 1985. "Regenerative Analysis and Steady State Distributions for Markov Chains," Operations Research, INFORMS, vol. 33(5), pages 1107-1116, October.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. S-P Chen, 2008. "Measuring performances of multiple-channel queueing systems with imprecise data: a membership function approach," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(3), pages 381-387, March.
    2. Mor Harchol-Balter & Takayuki Osogami & Alan Scheller-Wolf & Adam Wierman, 2005. "Multi-Server Queueing Systems with Multiple Priority Classes," Queueing Systems: Theory and Applications, Springer, vol. 51(3), pages 331-360, December.
    3. Ke Ma & Sébastien Thomassey & Xianyi Zeng, 2020. "Development of a central order processing system for optimizing demand-driven textile supply chains: a real case based simulation study," Annals of Operations Research, Springer, vol. 291(1), pages 627-656, August.
    4. Huh, Woonghee Tim & Lee, Jaywon & Park, Heesang & Park, Kun Soo, 2019. "The potty parity problem: Towards gender equality at restrooms in business facilities," Socio-Economic Planning Sciences, Elsevier, vol. 68(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. van den Hout, W.B. & Blanc, J.P.C., 1994. "The power-series algorithm for Markovian queueing networks," Other publications TiSEM 1312893d-c375-4b17-bbbe-3, Tilburg University, School of Economics and Management.
    2. Blanc, J.P.C., 1998. "The power-series algorithm for polling systems with time limits," Other publications TiSEM 3366bad3-964d-4039-82cc-a, Tilburg University, School of Economics and Management.
    3. Blanc, J.P.C. & van der Mei, R.D., 1992. "Optimization of polling systems with Bernoulli schedules," Research Memorandum FEW 563, Tilburg University, School of Economics and Management.
    4. Blanc, J.P.C. & Lenzini, L., 1995. "Analysis of communication systems with timed token protocols using the power-series algorithm," Discussion Paper 1995-100, Tilburg University, Center for Economic Research.
    5. van den Hout, W.B. & Blanc, J.P.C., 1994. "The Power-Series Algorithm for a Wide Class of Markov Processes," Other publications TiSEM 54b74f52-9378-47b9-aa0f-5, Tilburg University, School of Economics and Management.
    6. Blanc, J.P.C., 1993. "Performance Analysis and Optimization with the Power-Series Algorithm," Other publications TiSEM a1a4fc9c-dcb5-4679-9ef1-e, Tilburg University, School of Economics and Management.
    7. Blanc, J.P.C., 1996. "Optimization of Periodic Polling Systems with Non-Preemptive, Time-Limited Service," Discussion Paper 1996-63, Tilburg University, Center for Economic Research.
    8. Blanc, J.P.C., 1999. "On the Stability of Communication Systems with Timed Token Protocols," Other publications TiSEM bd28ec2d-1fc2-447d-9c0a-c, Tilburg University, School of Economics and Management.
    9. Valeriy Naumov, 2024. "A Matrix-Multiplicative Solution for Multi-Dimensional QBD Processes," Mathematics, MDPI, vol. 12(3), pages 1-15, January.
    10. Abhijit Datta Banik & Souvik Ghosh & M. L. Chaudhry, 2020. "On the optimal control of loss probability and profit in a GI/C-BMSP/1/N queueing system," OPSEARCH, Springer;Operational Research Society of India, vol. 57(1), pages 144-162, March.
    11. Pala, Ali & Zhuang, Jun, 2018. "Security screening queues with impatient applicants: A new model with a case study," European Journal of Operational Research, Elsevier, vol. 265(3), pages 919-930.
    12. Tijms, H.C. & Coevering, M.C.T. van de, 1990. "How to solve numerically the equilibrium equations of a Markov chain with infinitely many states," Serie Research Memoranda 0046, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    13. S. K. Samanta & R. Nandi, 2021. "Queue-Length, Waiting-Time and Service Batch Size Analysis for the Discrete-Time GI/D-MSP (a,b) / 1 / ∞ $^{\text {(a,b)}}/1/\infty $ Queueing System," Methodology and Computing in Applied Probability, Springer, vol. 23(4), pages 1461-1488, December.
    14. Blanc, J.P.C., 2009. "Bad luck when joining the shortest queue," European Journal of Operational Research, Elsevier, vol. 195(1), pages 167-173, May.
    15. A. Banik & U. Gupta, 2007. "Analyzing the finite buffer batch arrival queue under Markovian service process: GI X /MSP/1/N," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 15(1), pages 146-160, July.
    16. A. D. Banik & M. L. Chaudhry, 2017. "Efficient Computational Analysis of Stationary Probabilities for the Queueing System BMAP / G /1/ N With or Without Vacation(s)," INFORMS Journal on Computing, INFORMS, vol. 29(1), pages 140-151, February.
    17. Pekergin, Nihal & Dayar, Tugrul & Alparslan, Denizhan N., 2005. "Componentwise bounds for nearly completely decomposable Markov chains using stochastic comparison and reordering," European Journal of Operational Research, Elsevier, vol. 165(3), pages 810-825, September.
    18. V. Ramaswami & David Poole & Soohan Ahn & Simon Byers & Alan Kaplan, 2005. "Ensuring Access to Emergency Services in the Presence of Long Internet Dial-Up Calls," Interfaces, INFORMS, vol. 35(5), pages 411-422, October.
    19. Amod J. Basnet & Isaac M. Sonin, 2022. "Parallel computing for Markov chains with islands and ports," Annals of Operations Research, Springer, vol. 317(2), pages 335-352, October.
    20. Mor Harchol-Balter & Takayuki Osogami & Alan Scheller-Wolf & Adam Wierman, 2005. "Multi-Server Queueing Systems with Multiple Priority Classes," Queueing Systems: Theory and Applications, Springer, vol. 51(3), pages 331-360, December.

    More about this item

    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:eee:ejores:v:118:y:1999:i:1:p:181-193. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.