IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v67y2021i12p7708-7718.html
   My bibliography  Save this article

SRPT Scheduling Discipline in Many-Server Queues with Impatient Customers

Author

Listed:
  • Jing Dong

    (Graduate School of Business, Columbia University, New York, New York 10027)

  • Rouba Ibrahim

    (School of Management, University College London, London E14 5AB, United Kingdom)

Abstract

The shortest-remaining-processing-time (SRPT) scheduling policy has been extensively studied, for more than 50 years, in single-server queues with infinitely patient jobs. Yet, much less is known about its performance in multiserver queues. In this paper, we present the first theoretical analysis of SRPT in multiserver queues with abandonment. In particular, we consider the M / G I / s + G I queue and demonstrate that, in the many-sever overloaded regime, performance in the SRPT queue is equivalent, asymptotically in steady state, to a preemptive two-class priority queue where customers with short service times (below a threshold) are served without wait, and customers with long service times (above a threshold) eventually abandon without service. We prove that the SRPT discipline maximizes, asymptotically, the system throughput, among all scheduling disciplines. We also compare the performance of the SRPT policy to blind policies and study the effects of the patience-time and service-time distributions.

Suggested Citation

  • 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.
    • Handle: RePEc:inm:ormnsc:v:67:y:2021:i:12:p:7708-7718
    DOI: 10.1287/mnsc.2021.4110
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.2021.4110
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.2021.4110?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. Ward Whitt, 2005. "Engineering Solution of a Basic Call-Center Model," Management Science, INFORMS, vol. 51(2), pages 221-235, February.
    2. J. G. Dai & Tolga Tezcan, 2011. "State Space Collapse in Many-Server Diffusion Limits of Parallel Server Systems," Mathematics of Operations Research, INFORMS, vol. 36(2), pages 271-320, May.
    3. Lawrence Brown & Noah Gans & Avishai Mandelbaum & Anat Sakov & Haipeng Shen & Sergey Zeltyn & Linda Zhao, 2005. "Statistical Analysis of a Telephone Call Center: A Queueing-Science Perspective," Journal of the American Statistical Association, American Statistical Association, vol. 100, pages 36-50, March.
    4. Linus E. Schrage & Louis W. Miller, 1966. "The Queue M / G /1 with the Shortest Remaining Processing Time Discipline," Operations Research, INFORMS, vol. 14(4), pages 670-684, August.
    5. Douglas G. Down & H. Christian Gromoll & Amber L. Puha, 2009. "Fluid Limits for Shortest Remaining Processing Time Queues," Mathematics of Operations Research, INFORMS, vol. 34(4), pages 880-911, November.
    6. Ward Whitt, 2006. "Fluid Models for Multiserver Queues with Abandonments," Operations Research, INFORMS, vol. 54(1), pages 37-54, February.
    7. Linus Schrage, 1968. "Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline," Operations Research, INFORMS, vol. 16(3), pages 687-690, June.
    8. Robert J. Batt & Christian Terwiesch, 2015. "Waiting Patiently: An Empirical Study of Queue Abandonment in an Emergency Department," Management Science, INFORMS, vol. 61(1), pages 39-59, January.
    9. 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. Gabi Hanukov & Uri Yechiali, 2024. "Orbit while in service," Operational Research, Springer, vol. 24(2), pages 1-32, June.
    2. Qihui Bu, 2024. "Transient Analysis for a Queuing System with Impatient Customers and Its Applications to the Pricing Strategy of a Video Website," Mathematics, MDPI, vol. 12(13), pages 1-14, 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. Jouini, Oualid & Pot, Auke & Koole, Ger & Dallery, Yves, 2010. "Online scheduling policies for multiclass call centers with impatient customers," European Journal of Operational Research, Elsevier, vol. 207(1), pages 258-268, November.
    2. 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.
    3. Bolandifar, Ehsan & DeHoratius, Nicole & Olsen, Tava, 2023. "Modeling abandonment behavior among patients," European Journal of Operational Research, Elsevier, vol. 306(1), pages 243-254.
    4. Yonatan Shadmi, 2022. "Fluid limits for shortest job first with aging," Queueing Systems: Theory and Applications, Springer, vol. 101(1), pages 93-112, June.
    5. 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.
    6. Rouba Ibrahim & Ward Whitt, 2009. "Real-Time Delay Estimation in Overloaded Multiserver Queues with Abandonments," Management Science, INFORMS, vol. 55(10), pages 1729-1742, October.
    7. Łukasz Kruk & Ewa Sokołowska, 2016. "Fluid Limits for Multiple-Input Shortest Remaining Processing Time Queues," Mathematics of Operations Research, INFORMS, vol. 41(3), pages 1055-1092, August.
    8. Defraeye, Mieke & Van Nieuwenhuyse, Inneke, 2016. "Staffing and scheduling under nonstationary demand for service: A literature review," Omega, Elsevier, vol. 58(C), pages 4-25.
    9. Hyytiä, Esa & Penttinen, Aleksi & Aalto, Samuli, 2012. "Size- and state-aware dispatching problem with queue-specific job sizes," European Journal of Operational Research, Elsevier, vol. 217(2), pages 357-370.
    10. 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.
    11. Mor Armony & Nahum Shimkin & Ward Whitt, 2009. "The Impact of Delay Announcements in Many-Server Queues with Abandonment," Operations Research, INFORMS, vol. 57(1), pages 66-81, February.
    12. Łukasz Kruk & Robert Gieroba, 2022. "Local edge minimality of SRPT networks with shared resources," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 96(3), pages 459-492, December.
    13. Łukasz Kruk, 2022. "Heavy traffic analysis for single-server SRPT and LRPT queues via EDF diffusion limits," Annals of Operations Research, Springer, vol. 310(2), pages 411-429, March.
    14. 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.
    15. 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.
    16. Rouba Ibrahim & Ward Whitt, 2011. "Wait-Time Predictors for Customer Service Systems with Time-Varying Demand and Capacity," Operations Research, INFORMS, vol. 59(5), pages 1106-1118, October.
    17. Thomas Kittsteiner & Benny Moldovanu, 2005. "Priority Auctions and Queue Disciplines That Depend on Processing Time," Management Science, INFORMS, vol. 51(2), pages 236-248, February.
    18. Delasay, Mohammad & Ingolfsson, Armann & Kolfal, Bora & Schultz, Kenneth, 2019. "Load effect on service times," European Journal of Operational Research, Elsevier, vol. 279(3), pages 673-686.
    19. Tkachenko Andrey, 2013. "Multichannel queuing systems with balking and regenerative input fl ow," HSE Working papers WP BRP 14/STI/2013, National Research University Higher School of Economics.
    20. 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.

    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:ormnsc:v:67:y:2021:i:12:p:7708-7718. 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.