IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v58y2010i5p1427-1439.html
   My bibliography  Save this article

The c(mu)/(theta) Rule for Many-Server Queues with Abandonment

Author

Listed:
  • Rami Atar

    (Department of Electrical Engineering, Technion--Israel Institute of Technology, Haifa 32000, Israel)

  • Chanit Giat

    (Department of Electrical Engineering, Technion--Israel Institute of Technology, Haifa 32000, Israel)

  • Nahum Shimkin

    (Department of Electrical Engineering, Technion--Israel Institute of Technology, Haifa 32000, Israel)

Abstract

We consider a multiclass queueing system with multiple homogeneous servers and customer abandonment. For each customer class i , the holding cost per unit time, the service rate, and the abandonment rate are denoted by c i , (mu) i , and (theta) i , respectively. We prove that under a many-server fluid scaling and overload conditions, a server-scheduling policy that assigns priority to classes according to their index c i (mu) i / (theta) i is asymptotically optimal for minimizing the overall long-run average holding cost. An additional penalty on customer abandonment is easily incorporated into this model and leads to a similar index rule.

Suggested Citation

  • Rami Atar & Chanit Giat & Nahum Shimkin, 2010. "The c(mu)/(theta) Rule for Many-Server Queues with Abandonment," Operations Research, INFORMS, vol. 58(5), pages 1427-1439, October.
    • Handle: RePEc:inm:oropre:v:58:y:2010:i:5:p:1427-1439
    DOI: 10.1287/opre.1100.0826
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.1100.0826
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.1100.0826?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. Avishai Mandelbaum & Alexander L. Stolyar, 2004. "Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cμ-Rule," Operations Research, INFORMS, vol. 52(6), pages 836-855, December.
    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. Ward Whitt, 2006. "Fluid Models for Multiserver Queues with Abandonments," Operations Research, INFORMS, vol. 54(1), pages 37-54, February.
    4. Ward Whitt, 2004. "Efficiency-Driven Heavy-Traffic Approximations for Many-Server Queues with Abandonments," Management Science, INFORMS, vol. 50(10), pages 1449-1461, October.
    5. Jan A. Van Mieghem, 2003. "Due-Date Scheduling: Asymptotic Optimality of Generalized Longest Queue and Generalized Largest Delay Rules," Operations Research, INFORMS, vol. 51(1), pages 113-122, February.
    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. Tolga Tezcan & Jiheng Zhang, 2014. "Routing and Staffing in Customer Service Chat Systems with Impatient Customers," Operations Research, INFORMS, vol. 62(4), pages 943-956, August.
    2. Mor Armony & Avishai Mandelbaum, 2011. "Routing and Staffing in Large-Scale Service Systems: The Case of Homogeneous Impatient Customers and Heterogeneous Servers," Operations Research, INFORMS, vol. 59(1), pages 50-65, February.
    3. 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.
    4. Jun Luo & Jiheng Zhang, 2013. "Staffing and Control of Instant Messaging Contact Centers," Operations Research, INFORMS, vol. 61(2), pages 328-343, April.
    5. Alexander L. Stolyar & Tolga Tezcan, 2011. "Shadow-Routing Based Control of Flexible Multiserver Pools in Overload," Operations Research, INFORMS, vol. 59(6), pages 1427-1444, December.
    6. 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.
    7. 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.

    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. Alexander L. Stolyar & Tolga Tezcan, 2011. "Shadow-Routing Based Control of Flexible Multiserver Pools in Overload," Operations Research, INFORMS, vol. 59(6), pages 1427-1444, December.
    2. Noa Zychlinski, 2023. "Applications of fluid models in service operations management," Queueing Systems: Theory and Applications, Springer, vol. 103(1), pages 161-185, February.
    3. 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.
    4. Shuangchi He, 2020. "Diffusion Approximation for Efficiency-Driven Queues When Customers Are Patient," Operations Research, INFORMS, vol. 68(4), pages 1265-1284, July.
    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. Itai Gurvich & Ward Whitt, 2010. "Service-Level Differentiation in Many-Server Service Systems via Queue-Ratio Routing," Operations Research, INFORMS, vol. 58(2), pages 316-328, April.
    8. Junfei Huang & Avishai Mandelbaum & Hanqin Zhang & Jiheng Zhang, 2017. "Refined Models for Efficiency-Driven Queues with Applications to Delay Announcements and Staffing," Operations Research, INFORMS, vol. 65(5), pages 1380-1397, October.
    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. 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.
    11. 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.
    12. 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.
    13. 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.
    14. Kuang Xu & Yuan Zhong, 2020. "Information and Memory in Dynamic Resource Allocation," Operations Research, INFORMS, vol. 68(6), pages 1698-1715, November.
    15. Itai Gurvich & Ohad Perry, 2012. "Overflow Networks: Approximations and Implications to Call Center Outsourcing," Operations Research, INFORMS, vol. 60(4), pages 996-1009, August.
    16. Francis de Véricourt & Otis B. Jennings, 2008. "Dimensioning Large-Scale Membership Services," Operations Research, INFORMS, vol. 56(1), pages 173-187, February.
    17. Gregory Dobson & Tolga Tezcan & Vera Tilson, 2013. "Optimal Workflow Decisions for Investigators in Systems with Interruptions," Management Science, INFORMS, vol. 59(5), pages 1125-1141, May.
    18. Merve Bodur & James R. Luedtke, 2017. "Mixed-Integer Rounding Enhanced Benders Decomposition for Multiclass Service-System Staffing and Scheduling with Arrival Rate Uncertainty," Management Science, INFORMS, vol. 63(7), pages 2073-2091, July.
    19. Rami Atar & Avi Mandelbaum & Gennady Shaikhet, 2009. "Simplified Control Problems for Multiclass Many-Server Queueing Systems," Mathematics of Operations Research, INFORMS, vol. 34(4), pages 795-812, November.
    20. 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.

    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:oropre:v:58:y:2010:i:5:p:1427-1439. 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.