IDEAS home Printed from https://ideas.repec.org/a/spr/metcap/v25y2023i1d10.1007_s11009-023-09980-7.html
   My bibliography  Save this article

Matched Queues with Flexible and Impatient Customers

Author

Listed:
  • Heng-Li Liu

    (Yanshan University)

  • Quan-Lin Li

    (Beijing University of Technology)

Abstract

In this paper, we consider a double-ended queue with First-Come-First-Match discipline (also known as matched queues) under customers’ flexible and impatient behaviors. Such a system can be expressed as a level-dependent quasi-birth-and-death (QBD) process with infinitely many phases. The stability condition of the queueing system is given by using the mean drift technique. To deal with the level-dependent QBD process, we apply the RG-factorizations to obtain stationary probability vectors. Based on this, the queue size distributions and the average stationary queue lengths are given. Furthermore, we provide an effective method to discuss the sojourn time of any arriving customer and to compute the average sojourn time by using the technique of the first passage times and the phase-type (PH) distributions. Finally, some numerical examples are employed to illustrate how the performance measures are influenced by key system parameters.

Suggested Citation

  • Heng-Li Liu & Quan-Lin Li, 2023. "Matched Queues with Flexible and Impatient Customers," Methodology and Computing in Applied Probability, Springer, vol. 25(1), pages 1-26, March.
  • Handle: RePEc:spr:metcap:v:25:y:2023:i:1:d:10.1007_s11009-023-09980-7
    DOI: 10.1007/s11009-023-09980-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11009-023-09980-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s11009-023-09980-7?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
    ---><---

    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. Antonio Crescenzo & Virginia Giorno & Balasubramanian Krishna Kumar & Amelia G. Nobile, 2012. "A Double-ended Queue with Catastrophes and Repairs, and a Jump-diffusion Approximation," Methodology and Computing in Applied Probability, Springer, vol. 14(4), pages 937-954, December.
    2. Gideon Weiss, 2020. "Directed FCFS infinite bipartite matching," Queueing Systems: Theory and Applications, Springer, vol. 96(3), pages 387-418, December.
    3. B. Kashyap, 1967. "Further results for the double ended queue," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 11(1), pages 168-186, December.
    4. Susan H. Xu & Rhonda Righter & J. George Shanthikumar, 1992. "Optimal Dynamic Assignment of Customers to Heterogeneous Servers in Parallel," Operations Research, INFORMS, vol. 40(6), pages 1126-1138, December.
    5. Wenzhu Zhang & Yue Dai & Lin Tian, 2022. "Impact of capacity flexibility on service product line design," Annals of Operations Research, Springer, vol. 312(2), pages 1095-1118, May.
    6. Philipp Afèche & Adam Diamant & Joseph Milner, 2014. "Double-Sided Batch Queues with Abandonment: Modeling Crossing Networks," Operations Research, INFORMS, vol. 62(5), pages 1179-1201, October.
    7. Tolga Tezcan & J. G. Dai, 2010. "Dynamic Control of N -Systems with Many Servers: Asymptotic Optimality of a Static Priority Policy in Heavy Traffic," Operations Research, INFORMS, vol. 58(1), pages 94-110, February.
    8. Mahvareh Ahghari & Bariş Balcioĝlu, 2009. "Benefits of cross-training in a skill-based routing contact center with priority queues and impatient customers," IISE Transactions, Taylor & Francis Journals, vol. 41(6), pages 524-536.
    9. Ari Arapostathis & Guodong Pang, 2018. "Infinite-Horizon Average Optimality of the N-Network in the Halfin–Whitt Regime," Mathematics of Operations Research, INFORMS, vol. 43(3), pages 838-866, August.
    10. Antonio Di Crescenzo & Virginia Giorno & Balasubramanian Krishna Kumar & Amelia G. Nobile, 2018. "A Time-Non-Homogeneous Double-Ended Queue with Failures and Repairs and Its Continuous Approximation," Mathematics, MDPI, vol. 6(5), pages 1-23, May.
    11. Xin Liu, 2019. "Diffusion approximations for double-ended queues with reneging in heavy traffic," Queueing Systems: Theory and Applications, Springer, vol. 91(1), pages 49-87, February.
    12. Perlman, Yael & Elalouf, Amir & Yechiali, Uri, 2018. "Dynamic allocation of stochastically-arriving flexible resources to random streams of objects with application to kidney cross-transplantation," European Journal of Operational Research, Elsevier, vol. 265(1), pages 169-177.
    13. Linda Green, 1985. "A Queueing System with General-Use and Limited-Use Servers," Operations Research, INFORMS, vol. 33(1), pages 168-182, February.
    14. Samim Ghamami & Amy R. Ward, 2013. "Dynamic Scheduling of a Two-Server Parallel Server System with Complete Resource Pooling and Reneging in Heavy Traffic: Asymptotic Optimality of a Two-Threshold Policy," Mathematics of Operations Research, INFORMS, vol. 38(4), pages 761-824, November.
    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. A. N. Dudin & S. A. Dudin & O. S. Dudina, 2023. "Randomized Threshold Strategy for Providing Flexible Priority in Multi-Server Queueing System with a Marked Markov Arrival Process and Phase-Type Distribution of Service Time," Mathematics, MDPI, vol. 11(12), pages 1-23, June.

    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. Dongyuan Zhan & Gideon Weiss, 2018. "Many-server scaling of the N-system under FCFS–ALIS," Queueing Systems: Theory and Applications, Springer, vol. 88(1), pages 27-71, February.
    2. Adan, Ivo J.B.F. & Boon, Marko A.A. & Weiss, Gideon, 2019. "Design heuristic for parallel many server systems," European Journal of Operational Research, Elsevier, vol. 273(1), pages 259-277.
    3. Shi, Ying & Lian, Zhaotong, 2016. "Optimization and strategic behavior in a passenger–taxi service system," European Journal of Operational Research, Elsevier, vol. 249(3), pages 1024-1032.
    4. Ari Arapostathis & Guodong Pang, 2018. "Infinite-Horizon Average Optimality of the N-Network in the Halfin–Whitt Regime," Mathematics of Operations Research, INFORMS, vol. 43(3), pages 838-866, August.
    5. Francisco Castro & Hamid Nazerzadeh & Chiwei Yan, 2020. "Matching queues with reneging: a product form solution," Queueing Systems: Theory and Applications, Springer, vol. 96(3), pages 359-385, December.
    6. Carri W. Chan & Linda V. Green & Suparerk Lekwijit & Lijian Lu & Gabriel Escobar, 2019. "Assessing the Impact of Service Level When Customer Needs Are Uncertain: An Empirical Investigation of Hospital Step-Down Units," Management Science, INFORMS, vol. 65(2), pages 751-775, February.
    7. Giorno, Virginia & Nobile, Amelia G., 2022. "On some integral equations for the evaluation of first-passage-time densities of time-inhomogeneous birth-death processes," Applied Mathematics and Computation, Elsevier, vol. 422(C).
    8. Ying Shi & Zhaotong Lian, 2016. "Equilibrium Strategies and Optimal Control for a Double-Ended Queue," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(03), pages 1-18, June.
    9. Wyean Chan & Ger Koole & Pierre L'Ecuyer, 2014. "Dynamic Call Center Routing Policies Using Call Waiting and Agent Idle Times," Manufacturing & Service Operations Management, INFORMS, vol. 16(4), pages 544-560, October.
    10. E. Morozov & B. Steyaert, 2013. "Stability analysis of a two-station cascade queueing network," Annals of Operations Research, Springer, vol. 202(1), pages 135-160, January.
    11. Chai, Xudong & Liu, Liwei & Chang, Baoxian & Jiang, Tao & Wang, Zhen, 2019. "On a batch matching system with impatient servers and boundedly rational customers," Applied Mathematics and Computation, Elsevier, vol. 354(C), pages 308-328.
    12. Jinsheng Chen & Jing Dong & Pengyi Shi, 2020. "A survey on skill-based routing with applications to service operations management," Queueing Systems: Theory and Applications, Springer, vol. 96(1), pages 53-82, October.
    13. Philipp Afèche & Mojtaba Araghi & Opher Baron, 2017. "Customer Acquisition, Retention, and Service Access Quality: Optimal Advertising, Capacity Level, and Capacity Allocation," Manufacturing & Service Operations Management, INFORMS, vol. 19(4), pages 674-691, October.
    14. Li, Mengling & Riyanto, Yohanes E. & Xu, Menghan, 2023. "Prioritized organ allocation rules under compatibility constraints," Games and Economic Behavior, Elsevier, vol. 141(C), pages 403-427.
    15. Marina Milenković & Miloš Nikolić & Draženko Glavić, 2022. "Optimization of toll road lane operation: Serbian case study," Operational Research, Springer, vol. 22(5), pages 5297-5322, November.
    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. Xin Liu, 2019. "Diffusion approximations for double-ended queues with reneging in heavy traffic," Queueing Systems: Theory and Applications, Springer, vol. 91(1), pages 49-87, February.
    19. Keumseok Kang & J. George Shanthikumar & Kemal Altinkemer, 2016. "Postponable Acceptance and Assignment: A Stochastic Dynamic Programming Approach," Manufacturing & Service Operations Management, INFORMS, vol. 18(4), pages 493-508, October.
    20. Siqiao Li & Ger Koole & Xiaolan Xie, 2020. "An adaptive priority policy for radiotherapy scheduling," Flexible Services and Manufacturing Journal, Springer, vol. 32(1), pages 154-180, March.

    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:spr:metcap:v:25:y:2023:i:1:d:10.1007_s11009-023-09980-7. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.