To Pool or Not to Pool in Call Centers

Should we pool or not? This is a question of general interest for call center management. The general perception seems to exist that pooling is always beneficial either in terms of performance (mean waiting times and service levels) or agent capacity savings. This paper aims to show that also at practical call center level a more detailed answer is in place, which may even show the opposite. To this end, it will provide 1) insights and approximate formulae, 2) numerical support and 3) general conclusions. The orientation of the paper is threefold: instructive, practical and research-oriented. An instructive approach will be followed based upon: - standard queueing results and insights, - instructive examples and - numerical results. For practical call center purposes extensive numerical results and figures are given for the generic situation of pooling two agent groups of realistic orders. These include figures for practical usage. It is also argued and numerically illustrated that an improvement of both the unpooled and pooled scenario can be achieved by overflow pooling. This in turn will lead to a variety of options for an optimization search, which is still highly open for scientific research. As such, the results are aimed at both call center practitioners and management scientists.

[1]  Nico M. van Dijk,et al.  UvA-DARE ( Digital Academic Repository ) Check-in computation and optimalization by simulation and IP in combination , 2004 .

[2]  Ward Whitt,et al.  A Staffing Algorithm for Call Centers with Skill-Based Routing , 2005, Manuf. Serv. Oper. Manag..

[3]  Jason Fama,et al.  Call center simulation modeling: methods, challenges, and opportunities , 2003, Proceedings of the 2003 Winter Simulation Conference, 2003..

[4]  Ward Whitt,et al.  Understanding the Efficiency of Multi-Server Service Systems , 1992 .

[5]  S. Turner,et al.  The Effect of Increasing Routing Choice on Resource Pooling , 1998, Probability in the Engineering and Informational Sciences.

[6]  Ward Whitt,et al.  Heavy-Traffic Limits for Queues with Many Exponential Servers , 1981, Oper. Res..

[7]  H. Akimaru,et al.  An Approximate Formula for Individual Call Losses in Overflow Systems , 1983, IEEE Trans. Commun..

[8]  Ronald W. Wolff,et al.  Stochastic Modeling and the Theory of Queues , 1989 .

[9]  Kurt Geihs,et al.  Bounds on buffer overflow probabilities in communication systems , 1982, Perform. Evaluation.

[10]  Jiyeon Lee,et al.  Asymptotics of overflow probabilities in Jackson networks , 2004, Oper. Res. Lett..

[11]  H. Bierman,et al.  Quantitative analysis for business decisions , 1969 .

[12]  Michael Mitzenmacher,et al.  The Power of Two Choices in Randomized Load Balancing , 2001, IEEE Trans. Parallel Distributed Syst..

[13]  Sem C. Borst,et al.  Dimensioning Large Call Centers , 2000, Oper. Res..

[14]  R. Butterworth,et al.  Queueing Systems, Vol. II: Computer Applications. , 1977 .

[15]  Richard C. Larson,et al.  OR Forum - Perspectives on Queues: Social Justice and the Psychology of Queueing , 1987, Oper. Res..

[16]  N. M. van Dijk,et al.  Call packing bounds for overflow queues , 2004 .

[17]  Philippe Chevalier,et al.  Overflow analysis and cross-trained servers , 2003 .

[18]  Ger Koole,et al.  Approximating multi-skill blocking systems by HyperExponential Decomposition , 2006, Perform. Evaluation.

[19]  Onno Boxma,et al.  ERMR: A generalised Equivalent Random Method for overflow systems with Repacking , 1998 .

[20]  Avishai Mandelbaum,et al.  Telephone Call Centers: Tutorial, Review, and Research Prospects , 2003, Manuf. Serv. Oper. Manag..

[21]  Sandjai Bhulai,et al.  On the structure of value functions for threshold policies in queueing models , 2003, Journal of Applied Probability.

[22]  Avishai Mandelbaum,et al.  On Pooling in Queueing Networks , 1998 .

[23]  Michael H. Rothkopf,et al.  Perspectives on Queues: Combining Queues is Not Always Beneficial , 1987, Oper. Res..

[24]  M. Reiman,et al.  The multiclass GI/PH/N queue in the Halfin-Whitt regime , 2000, Advances in Applied Probability.

[25]  Peter G. Taylor,et al.  A PRODUCT-FORM 'LOSS NETWORK' WITH A FORM OF QUEUEING , 1997 .

[26]  Winfried K. Grassmann,et al.  The Bilingual Server System: A Queueing Model Featuring Fully And Partially Qualified Servers , 1993 .

[27]  Ger Koole,et al.  Structural results for the control of queueing systems using event-based dynamic programming , 1998, Queueing Syst. Theory Appl..

[28]  Rodney B. Wallace,et al.  RESOURCE POOLING AND STAFFING IN CALL CENTERS WITH SKILL-BASED ROUTING , 2004 .

[29]  Muhammad El-Taha,et al.  Traffic overflow in loss systems with selective trunk reservation , 2000, Perform. Evaluation.

[30]  Frederick S. Hillier,et al.  Introduction of Operations Research , 1967 .

[31]  Ronald J. Williams,et al.  Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: asymptotic optimality of a threshold policy , 2001 .

[32]  Paul J. Schweitzer,et al.  Stochastic Models, an Algorithmic Approach , by Henk C. Tijms (Chichester: Wiley, 1994), 375 pages, paperback. , 1996, Probability in the Engineering and Informational Sciences.

[33]  Kyle D. Cattani,et al.  The Pooling Principle , 2005 .

[34]  Christoph H. Loch,et al.  Operations management and reengineering , 1998 .

[35]  A. Hordijk,et al.  Stochastic inequalities for an overflow model , 1987, Journal of Applied Probability.

[36]  George P. Cosmetatos.  Some Approximate Equilibrium Results for the Multi-Server Queue (M/G/r)* , 1976 .

[37]  W. Whitt,et al.  Resource sharing for efficiency in traffic systems , 1981, The Bell System Technical Journal.

[38]  R. R. P. Jackson.  Introduction to Queueing Theory , 1943 .

[39]  Nico M. van Dijk,et al.  Bounds and error bounds for queueing networks , 1998, Ann. Oper. Res..

[40]  Winfried K. Grassmann.  Finding the Right Number of Servers in Real-World Queuing Systems , 1988 .

[41]  Erik A. van Doorn,et al.  On the Overflow Process from a Finite Markovian Queue , 1984, Perform. Evaluation.

[42]  John A. Buzacott,et al.  Commonalities in Reengineered Business Processes: Models and Issues , 1996 .

[43]  Alan Scheller-Wolf,et al.  Robustness of threshold policies in beneficiary-donor model , 2005, PERV.

[44]  John F. Shortle.  An Equivalent Random Method with hyper-exponential service , 2004, Perform. Evaluation.

[45]  J. George Shanthikumar,et al.  Jackson Network Models of Manufacturing Systems , 1994 .

[46]  Geert Jan Franx,et al.  A simple solution for the M/D/c waiting time distribution , 2001, Oper. Res. Lett..

[47]  Ward Whitt,et al.  Server Staffing to Meet Time-Varying Demand , 1996 .