IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i18p3878-d1237658.html
   My bibliography  Save this article

Analysis of a Pre-Emptive Two-Priority Queuing System with Impatient Customers and Heterogeneous Servers

Author

Listed:
  • Mingang Yin

    (School of Mechanical Engineering, Shenyang University of Technology, Shenyang 110870, China)

  • Ming Yan

    (School of Mechanical Engineering, Shenyang University of Technology, Shenyang 110870, China)

  • Yu Guo

    (School of Mechanical Engineering & Automation, Northeastern University, Shenyang 110819, China)

  • Minghe Liu

    (School of Mechanical Engineering, Shenyang Jianzhu University, Shenyang 110168, China)

Abstract

This paper presents a queuing system model that incorporates multiple priorities, multiple abandonments, and heterogeneous servers. Waiting for service easily leads to impatient behaviors. The impact of two kinds of impatient behaviors, balking and reneging, on queueing system performance is examined. The problem is formulated as continuous-time Markov chains. It also introduces a special state called the non-sojourn state to record the number of customers who abandon the system. The state transition rate matrix is transformed into a block tridiagonal matrix by appropriately setting the state numbers. A novel indicator called interstate transition frequency is proposed, which aids in distinguishing state transitions during the system evaluation process. Based on the interstate transition frequency, a set of indicators is derived to offer additional analytical perspectives for the queuing system. Finally, the proposed model is applied to an automobile repair shop to validate its effectiveness in practical scenarios.

Suggested Citation

  • Mingang Yin & Ming Yan & Yu Guo & Minghe Liu, 2023. "Analysis of a Pre-Emptive Two-Priority Queuing System with Impatient Customers and Heterogeneous Servers," Mathematics, MDPI, vol. 11(18), pages 1-16, September.
    • Handle: RePEc:gam:jmathe:v:11:y:2023:i:18:p:3878-:d:1237658
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/18/3878/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/11/18/3878/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Yaolei Wang & Yiming Fan & Taozeng Zhu & Ping Cao & Jingui Xie, 2019. "An approximation method for 2-chain flexible queues with preemptive priority," International Journal of Production Research, Taylor & Francis Journals, vol. 57(19), pages 5935-5950, October.
    2. Shlomo Halfin & Ward Whitt, 1981. "Heavy-Traffic Limits for Queues with Many Exponential Servers," Operations Research, INFORMS, vol. 29(3), pages 567-588, June.
    3. Wei Chang, 1965. "Queuing with Nonpreemptive and Preemptive-Resume Priorities," Operations Research, INFORMS, vol. 13(6), pages 1020-1022, December.
    4. N. K. Jaiswal, 1961. "Preemptive Resume Priority Queue," Operations Research, INFORMS, vol. 9(5), pages 732-742, October.
    5. O Jouini & A Roubos, 2014. "On multiple priority multi-server queues with impatience," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 65(5), pages 616-632, May.
    6. Kuo-Hsiung Wang & Ying-Chung Chang, 2002. "Cost analysis of a finite M/M/R queueing system with balking, reneging, and server breakdowns," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 56(2), pages 169-180, November.
    7. Leonard Kleinrock & Roy P. Finkelstein, 1967. "Time Dependent Priority Queues," Operations Research, INFORMS, vol. 15(1), pages 104-116, February.
    Full references (including those not matched with items on IDEAS)

    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. Ivo Adan & Brett Hathaway & Vidyadhar G. Kulkarni, 2019. "On first-come, first-served queues with two classes of impatient customers," Queueing Systems: Theory and Applications, Springer, vol. 91(1), pages 113-142, February.
    2. Noah Gans & Ger Koole & Avishai Mandelbaum, 2003. "Telephone Call Centers: Tutorial, Review, and Research Prospects," Manufacturing & Service Operations Management, INFORMS, vol. 5(2), pages 79-141, September.
    3. Rami Atar & Adam Shwartz, 2008. "Efficient Routing in Heavy Traffic Under Partial Sampling of Service Times," Mathematics of Operations Research, INFORMS, vol. 33(4), pages 899-909, November.
    4. Avishai Mandelbaum & Petar Momčilović, 2017. "Personalized queues: the customer view, via a fluid model of serving least-patient first," Queueing Systems: Theory and Applications, Springer, vol. 87(1), pages 23-53, October.
    5. Amy R. Ward & Mor Armony, 2013. "Blind Fair Routing in Large-Scale Service Systems with Heterogeneous Customers and Servers," Operations Research, INFORMS, vol. 61(1), pages 228-243, February.
    6. Achal Bassamboo & J. Michael Harrison & Assaf Zeevi, 2006. "Design and Control of a Large Call Center: Asymptotic Analysis of an LP-Based Method," Operations Research, INFORMS, vol. 54(3), pages 419-435, June.
    7. Rouba Ibrahim & Mor Armony & Achal Bassamboo, 2017. "Does the Past Predict the Future? The Case of Delay Announcements in Service Systems," Management Science, INFORMS, vol. 63(6), pages 1762-1780, June.
    8. Divya Velayudhan Nair & Achyutha Krishnamoorthy & Agassi Melikov & Sevinj Aliyeva, 2021. "MMAP/(PH,PH)/1 Queue with Priority Loss through Feedback," Mathematics, MDPI, vol. 9(15), pages 1-26, July.
    9. Bolandifar, Ehsan & DeHoratius, Nicole & Olsen, Tava, 2023. "Modeling abandonment behavior among patients," European Journal of Operational Research, Elsevier, vol. 306(1), pages 243-254.
    10. Josh Reed & Yair Shaki, 2015. "A Fair Policy for the G / GI / N Queue with Multiple Server Pools," Mathematics of Operations Research, INFORMS, vol. 40(3), pages 558-595, March.
    11. Niyirora, Jerome & Zhuang, Jun, 2017. "Fluid approximations and control of queues in emergency departments," European Journal of Operational Research, Elsevier, vol. 261(3), pages 1110-1124.
    12. Achal Bassamboo & Assaf Zeevi, 2009. "On a Data-Driven Method for Staffing Large Call Centers," Operations Research, INFORMS, vol. 57(3), pages 714-726, June.
    13. James W. Taylor, 2012. "Density Forecasting of Intraday Call Center Arrivals Using Models Based on Exponential Smoothing," Management Science, INFORMS, vol. 58(3), pages 534-549, March.
    14. Itai Gurvich & Ohad Perry, 2012. "Overflow Networks: Approximations and Implications to Call Center Outsourcing," Operations Research, INFORMS, vol. 60(4), pages 996-1009, August.
    15. Öner-Közen, Miray & Minner, Stefan, 2017. "Impact of priority sequencing decisions on on-time probability and expected tardiness of orders in make-to-order production systems with external due-dates," European Journal of Operational Research, Elsevier, vol. 263(2), pages 524-539.
    16. Ari Arapostathis & Hassan Hmedi & Guodong Pang, 2021. "On Uniform Exponential Ergodicity of Markovian Multiclass Many-Server Queues in the Halfin–Whitt Regime," Mathematics of Operations Research, INFORMS, vol. 46(2), pages 772-796, May.
    17. Arka Ghosh & Keguo Huang, 2017. "Asymptotically optimal control of N-systems with $$H_2^*$$ H 2 ∗ service times under many-server heavy traffic," Queueing Systems: Theory and Applications, Springer, vol. 86(1), pages 35-60, June.
    18. van Leeuwaarden, Johan S.H. & Knessl, Charles, 2011. "Transient behavior of the Halfin-Whitt diffusion," Stochastic Processes and their Applications, Elsevier, vol. 121(7), pages 1524-1545, July.
    19. Francis de Véricourt & Otis B. Jennings, 2011. "Nurse Staffing in Medical Units: A Queueing Perspective," Operations Research, INFORMS, vol. 59(6), pages 1320-1331, December.
    20. Ramandeep S. Randhawa & Sunil Kumar, 2008. "Usage Restriction and Subscription Services: Operational Benefits with Rational Users," Manufacturing & Service Operations Management, INFORMS, vol. 10(3), pages 429-447, December.

    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:gam:jmathe:v:11:y:2023:i:18:p:3878-:d:1237658. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.