Institute of Mathematical Statistics Collections

Service times in call centers: Agent heterogeneity and learning with some operational consequences

Noah Gans, Nan Liu, Avishai Mandelbaum, Haipeng Shen, and Han Ye

Full-text: Open access

Abstract

Telephone call centers are data-rich environments that, until recently, have not received sustained attention from academics. For about a decade now, we have been fortunate to work with our colleague, mentor and friend, Larry Brown, on the collection and analysis of large call-center datasets. This work has provided many fascinating windows into the world of call-center operations, stimulating further research and affecting management practice. Larry’s inexhaustible curiosity and creativity, sharp insight and unique technical power, have continuously been an inspiration to us. We look forward to collaborating with and learning from him on many occasions to come.

In this paper, we study operational heterogeneity of call center agents. Our proxy for heterogeneity is agents’ service times (call durations), a performance measure that prevalently “enjoys" tight management control. Indeed, managers of large call centers argue that a 1-second increase/decrease in average service time can translate into additional/reduced operating costs on the order of millions of dollars per year.

We are motivated by an empirical analysis of call-center data, which identifies both short-term and long-term factors associated with agent heterogeneity. Operational consequences of such heterogeneity are then illustrated via discrete event simulation. This highlights the potential benefits of analyzing individual agents’ operational histories. We are thus naturally led to a detailed analysis of agents’ learning-curves, which reveals various learning patterns and opens up new research opportunities.

Chapter information

Source
James O. Berger, T. Tony Cai and Iain M. Johnstone, eds., Borrowing Strength: Theory Powering Applications – A Festschrift for Lawrence D. Brown (Beachwood, Ohio, USA: Institute of Mathematical Statistics, 2010), 99-123

Dates
First available in Project Euclid: 26 October 2010

Permanent link to this document
https://projecteuclid.org/euclid.imsc/1288099015

Digital Object Identifier
doi:10.1214/10-IMSCOLL608

Mathematical Reviews number (MathSciNet)
MR2798514

Rights
Copyright © 2010, Institute of Mathematical Statistics

Citation

Gans, Noah; Liu, Nan; Mandelbaum, Avishai; Shen, Haipeng; Ye, Han. Service times in call centers: Agent heterogeneity and learning with some operational consequences. Borrowing Strength: Theory Powering Applications – A Festschrift for Lawrence D. Brown, 99--123, Institute of Mathematical Statistics, Beachwood, Ohio, USA, 2010. doi:10.1214/10-IMSCOLL608. https://projecteuclid.org/euclid.imsc/1288099015


Export citation

References

  • [1] Aalen, O. O., Borgan, O. and Gjessing, H. K. (2008). Survival and Event History Analysis: A Process Point of View. Springer.
  • [2] Aksin, Z., Armony, M. and Mehrotra, V. (2007). The modern call center: A multi-disciplinary perspective on operations management research. Production and Operations Management 16 665–688.
  • [3] Aldor-Noiman, S., Feigin, P. D. and Mandelbaum, A. (2010). Workload forcasting for a call center: Methodology and a case study. Ann. Appl. Statist. To appear.
  • [4] Arlotto, A., Chick, S. and Gans, N. (2010). Hiring and retention of heterogeneous workers. In preparation.
  • [5] Armony, M. (2005). Dynamic routing in large-scale service systems with heterogeneous servers. Queueing Systems 51 287–329.
  • [6] Armony, M. and Mandelbaum, A. (2008). Routing and staffing in large-scale service systems: The case of homogeneous impatient customers and heterogeneous servers. Operations Research. To appear.
  • [7] Armony, M. and Ward, A. R. (2010). Fair Dynamic Routing in Large-Scale Heterogeneous-Server Systems. Operations Research. To appear.
  • [8] Asmussen, S. (2000). Ruin Probablities. World Scientific.
  • [9] Atar, R. (2008). Central limit theorem for a many-server queue with random service rates. Ann. Appl. Probab. 18 1548–1568.
  • [10] Atar, R., Shaki, Y. Y. and Shwartz, A. (2010). A blind policy for equalizing cumulative idleness. Preprint.
  • [11] Atar, R. and Shwartz, A. (2008). Efficient routing in heavy traffic under partial sampling of service times. Mathematics of Operations Research 33 899-909.
  • [12] Bailey, C. (1989). Forgetting and the learning curve: A laboratory study. Management Science 35 340–352.
  • [13] Borst, S., Mandelbaum, A. and Reiman, M. (2004). Dimensioning large call centers. Operations Research 52 17–34.
  • [14] Brown, L., Gans, N., Mandelbaum, A., Sakov, A., Shen, H., Zeltyn, S. and Zhao, L. (2005). Statistical analysis of a telephone call center. J. Amer. Statist. Assoc. 100 36–50.
  • [15] Buffa, E., Cosgrove, M. and Luce, B. (1976). An integrated work shift scheduling system. Decision Sciences 7 620–630.
  • [16] Donin, O., Trofimov, V., Zeltyn, S. and Mandelbaum, A. (2006). The Call Center of US Bank. DataMOCCA (Data MOdels for Call Centers Analysis), The Technion SEE Lab. Available at http://ie.technion.ac.il/ Labs/Serveng/files/The_Call_Center_of_US_Bank.pdf.
  • [17] Feldman, Z., Mandelbaum, A., Massey, W. A. and Whitt, W. (2008). Staffing of time-varying queues to achieve time-stable performance. Management Science 54 324–338.
  • [18] Gans, N., Koole, G. and Mandelbaum, A. (2003). Telephone call centers: Tutorial, review, and research prospects. Manufacturing and Service Operations Management 5 79–141.
  • [19] Garnett, O., Mandelbaum, A. and Reiman, M. (2002). Designing a call center with impatient customers. Manufacturing & Service Operations Management 4 208–227.
  • [20] Goldberg, Y., Ritov, Y. and Mandelbaum, A. (2010). The best linear unbiased estimator for continuation of a function. In preparation.
  • [21] Green, P. and Silverman, B. (1994). Nonparametric Regression and Generalized Linear Models: A Roughness Penalty Approach. Chapman & Hall/CRC.
  • [22] Gurvich, I. and Whitt, W. (2009). Queue-and-idleness-ratio controls in many-server service systems. Mathematics of Operations Research 34 363–396.
  • [23] Gurvich, I. and Whitt, W. (2009). Scheduling flexible servers with convex delay costs in many-server service systems. Manufacturing and Service Operations Management 11 237–253.
  • [24] Gustafson, H. (1982). Force-loss cost analysis. WH Mobley, Employee Turnover: Causes, Consequences, and Control 7. Addison-Wesley, Reading, MA.
  • [25] Halfin, S. and Whitt, W. (1981). Heavy-traffic limits for queues with many exponential servers. Operations Research 29 567–588.
  • [26] Khudiakov, P. and Gorfine, M. (2010). Frailty models for patience of customrs who redial for a telephone service. In prepration.
  • [27] Khudyakov, P., Gorfine, M. and Mandelbaum, A. (2010). Phase-type models of service times. In preparation.
  • [28] Lieberman, P., Trofimov, V. and Mandelbaum, A. (2008). Empirical Analysis of SBR in US Bank. DataMOCCA (Data MOdels for Call Centers Analysis), The Technion SEE Lab. Available at http://ie.technion.ac.il/Labs/ Serveng/files/Skills-Based-Routing_USBank.pdf.
  • [29] Mandelbaum, A. and Momcilovic, P. (2010). Queues with many servers and impatient customers. Mathematics of Operations Research. To appear.
  • [30] Mandelbaum, A. and Reiman, M. (1998). On pooling in queueing networks. Management Science 44 971–981.
  • [31] Mandelbaum, A. and Zeltyn, S. (2009). Service engineering: Data-based course development and teaching; full version. To be published in “IFORMS Transaction on Education", special issue on “Teaching Services and Retail Operations Management". Available at http://ie.technion.ac.il/serveng/ References/teaching_paper.pdf.
  • [32] Momcilovic, P. and Mandelbaum, A. (2010). List-based routing. In preparation.
  • [33] Nembhard, D. and Osothsilp, N. (2002). Task complexity effects on between-individual learning/forgetting variability. International Journal of Industrial Ergonomics 29 297–306.
  • [34] Nembhard, D. and Uzumeri, M. (2000). Experiential learning and forgetting for manual and cognitive tasks. International Journal of Industrial Ergonomics 25 315–326.
  • [35] Reich, M., Mandelbaum, A. and Ritov, Y. (2010). The workload process: Modelling, inference and applications. In preparation.
  • [36] Shafer, S., Nembhard, D. and Uzumeri, M. (2001). The effects of worker learning, forgetting, and heterogeneity on assembly line productivity. Management Science 47 1639–1653.
  • [37] Shen, H., Brown, L. and Zhi, H. (2006). Efficient estimation of log-normal means with application to pharmacokinetic data. Stat. Med. 25 3023–3038.
  • [38] Shen, H. and Huang, J. (2008). Interday forecasting and intraday updating of call center arrivals. Manufacturing and Service Operations Management 10 391–410.
  • [39] Sisselman, M. E. and Whitt, W. (2007). Value-based routing and preference-based routing in customer contact centers. Production and Operations Management 16 277-291.
  • [40] Sze, D. (1984). A queueing model for telephone operator staffing. Operations Research 32 229–249.
  • [41] Talluri, K. T. and Ryzin, G. V. (2005). The Theory and Practice of Revenue Management. Springer.
  • [42] Tezcan, T. (2008). Optimal control of distributed parallel server systems under the Halfin and Whitt regime. Mathematics of Operations Research 33 51–90.
  • [43] Trofimov, V., Feigin, P., Mandelbaum, A., Ishay, E. and Nadjharov, E. (2006). DATA-MOCCA: Data model for call center analysis. Technical Report, Technion – Israel Institute of Technology.
  • [44] Tseytlin, Y., Mandelbaum, A. and Momcilovic, P. (2010). Queueing systems with heterogeneous servers: On fair routing of patients in emergency departments. In preparation.
  • [45] Weinberg, J., Brown, L. and Stroud, J. (2007). Bayesian forecasting of an inhomogeneous Poisson process with applications to call center data. J. Amer. Statist. Assoc. 102 1185–1198.
  • [46] Whitt, W. (1999). Dynamic staffing in a telephone call center aiming to immediately answer all calls. Operations Research Letters 24 205–212.
  • [47] Winer, R. S. (2001). A framework for customer relationship management. California Management Review.
  • [48] Yelle, L. (1979). The learning curve: Historical review and comprehensive survey. Decision Sciences 10 302–328.
  • [49] Zeltyn, S., Carmeli, B., Greenshpan, O., Mesika, Y., Wasserkrug, S., Vortman, P., Marmor, Y. N., Mandelbaum, A., Shtub, A., Lauterman, T., Schwartz, D., Moskovitch, K., Tzafrir, S. and Basis, F. (2009). Simulation-Based Models of Emergency Departments: Operational, Tactical and Strategic Staffing. Submitted to ACM Transactions on Modeling and Computer Simulation (TOMACS).