IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v47y2022i2p1192-1228.html

Fluid Limits for Multiclass Many-Server Queues with General Reneging Distributions and Head-of-the-Line Scheduling

Author

Listed:
  • Amber L. Puha

    (Department of Mathematics, California State University San Marcos, San Marcos, California 92096)

  • Amy R. Ward

    (The University of Chicago Booth School of Business, Chicago, Illinois 60637)

Abstract

We describe a fluid model with time-varying input that approximates a multiclass many-server queue with general reneging distribution and multiple customer classes (specifically, the multiclass G/GI/N+GI queue). The system dynamics depend on the policy, which is a rule for determining when to serve a given customer class. The class of admissible control policies are those that are head-of-the-line (HL) and nonanticipating. For a sequence of many-server queues operating under admissible HL control policies and satisfying some mild asymptotic conditions, we establish a tightness result for the sequence of fluid scaled queue state descriptors and associated processes and show that limit points of such sequences are fluid model solutions almost surely. The tightness result together with the characterization of distributional limit points as fluid model solutions almost surely provides a foundation for the analysis of particular HL control policies of interest. We leverage these results to analyze a set of admissible HL control policies that we introduce, called weighted random buffer selection (WRBS), and an associated WRBS fluid model that allows multiple classes to be partially served in the fluid limit (which is in contrast to previously analyzed static priority policies).

Suggested Citation

  • Amber L. Puha & Amy R. Ward, 2022. "Fluid Limits for Multiclass Many-Server Queues with General Reneging Distributions and Head-of-the-Line Scheduling," Mathematics of Operations Research, INFORMS, vol. 47(2), pages 1192-1228, May.
  • Handle: RePEc:inm:ormoor:v:47:y:2022:i:2:p:1192-1228
    DOI: 10.1287/moor.2021.1166
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.2021.1166
    Download Restriction: no

    File URL: https://libkey.io/10.1287/moor.2021.1166?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
    ---><---

    References listed on IDEAS

    as
    1. Philipp Afèche, 2013. "Incentive-Compatible Revenue Management in Queueing Systems: Optimal Strategic Delay," Manufacturing & Service Operations Management, INFORMS, vol. 15(3), pages 423-443, July.
    2. Philipp Afèche & J. Michael Pavlin, 2016. "Optimal Price/Lead-Time Menus for Queues with Customer Choice: Segmentation, Pooling, and Strategic Delay," Management Science, INFORMS, vol. 62(8), pages 2412-2436, August.
    3. Ward Whitt, 2006. "Fluid Models for Multiserver Queues with Abandonments," Operations Research, INFORMS, vol. 54(1), pages 37-54, February.
    4. Dongyuan Zhan & Amy R. Ward, 2019. "Staffing, Routing, and Payment to Trade off Speed and Quality in Large Service Systems," Operations Research, INFORMS, vol. 67(6), pages 1738-1751, November.
    5. Rami Atar & Haya Kaspi & Nahum Shimkin, 2014. "Fluid Limits for Many-Server Systems with Reneging Under a Priority Policy," Mathematics of Operations Research, INFORMS, vol. 39(3), pages 672-696, August.
    6. Achal Bassamboo & Ramandeep Singh Randhawa, 2016. "Scheduling Homogeneous Impatient Customers," Management Science, INFORMS, vol. 62(7), pages 2129-2147, July.
    7. Jeunghyun Kim & Ramandeep S. Randhawa & Amy R. Ward, 2018. "Dynamic Scheduling in a Many-Server, Multiclass System: The Role of Customer Impatience in Large Systems," Manufacturing & Service Operations Management, INFORMS, vol. 20(2), pages 285-301, May.
    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. Zhenghua Long & Hailun Zhang & Jiheng Zhang & Zhe George Zhang, 2024. "The Generalized c / μ Rule for Queues with Heterogeneous Server Pools," Operations Research, INFORMS, vol. 72(6), pages 2488-2506, November.
    2. Yueyang Zhong & John R. Birge & Amy R. Ward, 2025. "Learning to Schedule in Multiclass Many-Server Queues with Abandonment," Operations Research, INFORMS, vol. 73(6), pages 3085-3103, November.
    3. Eva H. Loeser & Ruth J. Williams, 2025. "Fluid limit for a multi-server, multiclass random order of service queue with reneging and tracking of residual patience times," Queueing Systems: Theory and Applications, Springer, vol. 109(2), pages 1-78, 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. Zhenghua Long & Nahum Shimkin & Hailun Zhang & Jiheng Zhang, 2020. "Dynamic Scheduling of Multiclass Many-Server Queues with Abandonment: The Generalized cμ / h Rule," Operations Research, INFORMS, vol. 68(4), pages 1128-1230, July.
    2. Zhenghua Long & Hailun Zhang & Jiheng Zhang & Zhe George Zhang, 2024. "The Generalized c / μ Rule for Queues with Heterogeneous Server Pools," Operations Research, INFORMS, vol. 72(6), pages 2488-2506, November.
    3. Zhiheng Zhong & Ping Cao & Junfei Huang & Sean X. Zhou, 2024. "Capacity Allocation and Scheduling in Two-Stage Service Systems with Multiclass Customers," Manufacturing & Service Operations Management, INFORMS, vol. 26(5), pages 1842-1859, September.
    4. Xu Yong & Liu Jian & Ma Baomei & Zhang Shuai, 2018. "Service Mechanism and Pricing Based on Fairness Preference of Customers in Queuing System," Journal of Systems Science and Information, De Gruyter, vol. 6(6), pages 481-494, December.
    5. Zhenghua Long & Jiheng Zhang, 2019. "Virtual allocation policies for many-server queues with abandonment," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 90(3), pages 399-451, December.
    6. Dongyuan Zhan & Amy R. Ward, 2019. "Staffing, Routing, and Payment to Trade off Speed and Quality in Large Service Systems," Operations Research, INFORMS, vol. 67(6), pages 1738-1751, November.
    7. Jalili Marand, Ata & Tang, Ou & Li, Hongyan, 2019. "Quandary of service logistics: Fast or reliable?," European Journal of Operational Research, Elsevier, vol. 275(3), pages 983-996.
    8. Zhenghua Long & Tolga Tezcan & Jiheng Zhang, 2024. "Routing and Staffing in Customer Service Chat Systems with Generally Distributed Service and Patience Times," Manufacturing & Service Operations Management, INFORMS, vol. 26(5), pages 1674-1691, September.
    9. Achal Bassamboo & Ramandeep Randhawa & Chenguang (Allen) Wu, 2023. "Optimally Scheduling Heterogeneous Impatient Customers," Manufacturing & Service Operations Management, INFORMS, vol. 25(3), pages 1066-1080, May.
    10. Leon Yang Chu & Zhixi Wan & Dongyuan Zhan, 2018. "Harnessing the Double-edged Sword via Routing: Information Provision on Ride-hailing Platforms," Working Papers 18-04, NET Institute.
    11. Jian Liu & Yongpin Zhou & Jian Chen & Peng Li, 2024. "Reference Dependence in Queue Design and Pricing Strategies," Service Science, INFORMS, vol. 16(4), pages 272-296, December.
    12. Atar, Rami & Biswas, Anup & Kaspi, Haya, 2018. "Law of large numbers for the many-server earliest-deadline-first queue," Stochastic Processes and their Applications, Elsevier, vol. 128(7), pages 2270-2296.
    13. Achal Bassamboo & Ramandeep Singh Randhawa, 2016. "Scheduling Homogeneous Impatient Customers," Management Science, INFORMS, vol. 62(7), pages 2129-2147, July.
    14. 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.
    15. De Munck, Thomas & Chevalier, Philippe & Tancrez, Jean-Sébastien, 2023. "Managing priorities on on-demand service platforms with waiting time differentiation," International Journal of Production Economics, Elsevier, vol. 266(C).
    16. Weining Kang, 2026. "Well-Posedness and Sensitivity Analysis of a Fluid Model for Multiclass Many-Server Queues with Abandonment Under Global FCFS Discipline," Mathematics of Operations Research, INFORMS, vol. 51(1), pages 149-184, January.
    17. Mor Armony & Galit Bracha Yom-Tov, 2026. "Hospital vs. Home Care: Trading off Predischarge and Postdischarge Infection and Mortality Risks," Manufacturing & Service Operations Management, INFORMS, vol. 28(1), pages 57-75, January.
    18. Jing Dong & Rouba Ibrahim, 2021. "SRPT Scheduling Discipline in Many-Server Queues with Impatient Customers," Management Science, INFORMS, vol. 67(12), pages 7708-7718, December.
    19. Mustafa Dogan & Alexandre Jacquillat, 2026. "On-Demand Service Sharing via Collective Dynamic Pricing," Manufacturing & Service Operations Management, INFORMS, vol. 28(2), pages 400-420, March.
    20. Hossein Abouee‐Mehrizi & Ata Ghareaghaji Zare & Renata A. Konrad, 2022. "Pricing in Service Systems with Rational Balking and Abandonment of Time‐Sensitive Customers," Production and Operations Management, Production and Operations Management Society, vol. 31(2), pages 495-510, February.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;

    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:ormoor:v:47:y:2022:i:2:p:1192-1228. 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: 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.