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

Dimensioning Large Call Centers

Author

Listed:
  • Sem Borst

    (CWI, P. O. Box 94079, 1090 GB Amsterdam, The Netherlands, and Bell Labs, Lucent Technologies, Murray Hill, New Jersey 07974-0636)

  • Avi Mandelbaum

    (Faculty of Industrial Engineering and Management, Technion, Haifa 32000, Israel)

  • Martin I. Reiman

    (Bell Labs, Lucent Technologies, Murray Hill, New Jersey 07974-0636)

Abstract

We develop a framework for asymptotic optimization of a queueing system. The motivation is the staffing problem of large call centers, which we have modeled as M/M/N queues with N , the number of agents, being large. Within our framework, we determine the asymptotically optimal staffing level N * that trades off agents' costs with service quality: the higher the latter, the more expensive is the former. As an alternative to this optimization, we also develop a constraint satisfaction approach where one chooses the least N * that adheres to a given constraint on waiting cost. Either way, the analysis gives rise to three regimes of operation: quality-driven, where the focus is on service quality; efficiency-driven, which emphasizes agents' costs; and a rationalized regime that balances, and in fact unifies, the other two. Numerical experiments reveal remarkable accuracy of our asymptotic approximations: over a wide range of parameters, from the very small to the extremely large, N * is exactly optimal, or it is accurate to within a single agent. We demonstrate the utility of our approach by revisiting the square-root safety staffing principle, which is a long-existing rule of thumb for staffing the M/M/N queue. In its simplest form, our rule is as follows: if c is the hourly cost of an agent, and a is the hourly cost of customers' delay, then N * = R + y* (a/c)(sqrt)R , where R is the offered load, and y *(·) is a function that is easily computable.

Suggested Citation

  • Sem Borst & Avi Mandelbaum & Martin I. Reiman, 2004. "Dimensioning Large Call Centers," Operations Research, INFORMS, vol. 52(1), pages 17-34, February.
  • Handle: RePEc:inm:oropre:v:52:y:2004:i:1:p:17-34
    DOI: 10.1287/opre.1030.0081
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.1030.0081
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.1030.0081?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. Geurt Jongbloed & Ger Koole, 2001. "Managing uncertainty in call centres using Poisson mixtures," Applied Stochastic Models in Business and Industry, John Wiley & Sons, vol. 17(4), pages 307-318, October.
    2. Bruce Andrews & Henry Parsons, 1993. "Establishing Telephone-Agent Staffing Levels through Economic Optimization," Interfaces, INFORMS, vol. 23(2), pages 14-20, April.
    3. Shlomo Halfin & Ward Whitt, 1981. "Heavy-Traffic Limits for Queues with Many Exponential Servers," Operations Research, INFORMS, vol. 29(3), pages 567-588, June.
    4. Ward Whitt, 1992. "Understanding the Efficiency of Multi-Server Service Systems," Management Science, INFORMS, vol. 38(5), pages 708-723, May.
    5. W. K. Grassmann, 1986. "Is the Fact that the Emperor Wears No Clothes a Subject Worthy of Publication?," Interfaces, INFORMS, vol. 16(2), pages 43-51, April.
    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. 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.
    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. Opher Baron & Joseph Milner, 2009. "Staffing to Maximize Profit for Call Centers with Alternate Service-Level Agreements," Operations Research, INFORMS, vol. 57(3), pages 685-700, June.
    4. Heemskerk, M. & Mandjes, M. & Mathijsen, B., 2022. "Staffing for many-server systems facing non-standard arrival processes," European Journal of Operational Research, Elsevier, vol. 296(3), pages 900-913.
    5. 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.
    6. 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.
    7. 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.
    8. Francis de Véricourt & Otis B. Jennings, 2008. "Dimensioning Large-Scale Membership Services," Operations Research, INFORMS, vol. 56(1), pages 173-187, February.
    9. O. Garnet & A. Mandelbaum & M. Reiman, 2002. "Designing a Call Center with Impatient Customers," Manufacturing & Service Operations Management, INFORMS, vol. 4(3), pages 208-227, October.
    10. A. J. E. M. Janssen & J. S. H. van Leeuwaarden & Bert Zwart, 2011. "Refining Square-Root Safety Staffing by Expanding Erlang C," Operations Research, INFORMS, vol. 59(6), pages 1512-1522, December.
    11. Josh Reed & Bo Zhang, 2017. "Managing capacity and inventory jointly for multi-server make-to-stock queues," Queueing Systems: Theory and Applications, Springer, vol. 86(1), pages 61-94, June.
    12. Alfonso J. Pedraza-Martinez & Sameer Hasija & Luk N. Van Wassenhove, 2020. "Fleet Coordination in Decentralized Humanitarian Operations Funded by Earmarked Donations," Operations Research, INFORMS, vol. 68(4), pages 984-999, July.
    13. Ward Whitt, 2003. "How Multiserver Queues Scale with Growing Congestion-Dependent Demand," Operations Research, INFORMS, vol. 51(4), pages 531-542, August.
    14. Malaki, Saha & Izady, Navid & de Menezes, Lilian M., 2023. "A framework for optimal recruitment of temporary and permanent healthcare workers in highly uncertain environments," European Journal of Operational Research, Elsevier, vol. 308(2), pages 768-781.
    15. R. Bekker & A. Bruin, 2010. "Time-dependent analysis for refused admissions in clinical wards," Annals of Operations Research, Springer, vol. 178(1), pages 45-65, July.
    16. René Bekker & Paulien Koeleman, 2011. "Scheduling admissions and reducing variability in bed demand," Health Care Management Science, Springer, vol. 14(3), pages 237-249, September.
    17. J. Michael Harrison & Assaf Zeevi, 2004. "Dynamic Scheduling of a Multiclass Queue in the Halfin-Whitt Heavy Traffic Regime," Operations Research, INFORMS, vol. 52(2), pages 243-257, April.
    18. Constantinos Maglaras & Assaf Zeevi, 2004. "Diffusion Approximations for a Multiclass Markovian Service System with “Guaranteed” and “Best-Effort” Service Levels," Mathematics of Operations Research, INFORMS, vol. 29(4), pages 786-813, November.
    19. Noa Zychlinski, 2023. "Applications of fluid models in service operations management," Queueing Systems: Theory and Applications, Springer, vol. 103(1), pages 161-185, February.
    20. Constantinos Maglaras & Assaf Zeevi, 2003. "Pricing and Capacity Sizing for Systems with Shared Resources: Approximate Solutions and Scaling Relations," Management Science, INFORMS, vol. 49(8), pages 1018-1038, August.

    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:52:y:2004:i:1:p:17-34. 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.