Markov chain models of a telephone call center with call blending

Motivated by a Bell Canada call center operating in blend mode, we consider a system with two types of traffic and two types of agents. Outbound calls are served only by blend agents, whereas inbound calls can be served by either inbound-only or blend agents. Inbound callers may balk or abandon. There are several performance measures of interest, including the rate of outbound calls and the proportion of inbound calls waiting more than some fixed number of seconds. We present a collection of continuous-time Markov chain (CTMC) models which capture many real-world characteristics while maintaining parsimony that results in fast computation. We discuss and explore the tradeoffs between model fidelity and efficacy and compare our different CTMC models with a realistic simulation model of a Bell Canada call center, used as a benchmark.

[1]  Ger Koole,et al.  Managing uncertainty in call centres using Poisson mixtures , 2001 .

[2]  W. Grassmann.  Transient solutions in Markovian queues : An algorithm for finding them and determining their waiting-time distributions , 1977 .

[3]  James Demmel,et al.  LAPACK Users' Guide, Third Edition , 1999, Software, Environments and Tools.

[4]  Donald Gross,et al.  The Randomization Technique as a Modeling Tool and Solution Procedure for Transient Markov Processes , 1984, Oper. Res..

[5]  A. Brandt,et al.  On a Two-Queue Priority System with Impatience and its Application to a Call Center* , 1999 .

[6]  Avishai Mandelbaum,et al.  Statistical Analysis of a Telephone Call Center , 2005 .

[7]  Pierre L'Ecuyer,et al.  Modeling Daily Arrivals to a Telephone Call Center , 2003, Manag. Sci..

[8]  T. J. Dekker,et al.  Two Efficient Algorithms with Guaranteed Convergence for Finding a Zero of a Function , 1975, TOMS.

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

[10]  Jack Dongarra,et al.  LAPACK Users' Guide, 3rd ed. , 1999 .

[11]  Ed Anderson,et al.  LAPACK Users' Guide , 1995 .

[12]  Peter J. Kolesar,et al.  Improving the Sipp Approach for Staffing Service Systems That Have Cyclic Demands , 2001, Oper. Res..

[13]  Winfried K. Grassmann.  Transient solutions in markovian queueing systems , 1977, Comput. Oper. Res..

[14]  Andreas Brandt,et al.  On the M(n)/M(n)/s Queue with Impatient Calls , 1999, Perform. Evaluation.

[15]  Douglas A. Samuelson,et al.  Predictive Dialing for Outbound Telephone Call Centers , 1999, Interfaces.

[16]  Richard P. Brent,et al.  An Algorithm with Guaranteed Convergence for Finding a Zero of a Function , 1971, Comput. J..

[17]  Avishai Mandelbaum,et al.  Queueing Models of Call Centers: An Introduction , 2002, Ann. Oper. Res..

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

[19]  G. M. Jenkins,et al.  Stochastic Service Systems. , 1964 .

[20]  Sandjai Bhulai,et al.  A queueing model for call blending in call centers , 2003, IEEE Trans. Autom. Control..

[21]  Ger Koole.  A formula for tail probabilities of Cox distributions , 2004, Journal of Applied Probability.

[22]  Sheldon M. Ross,et al.  Stochastic Processes , 2018, Gauge Integral Structures for Stochastic Calculus and Quantum Electrodynamics.

[23]  Pierre L'Ecuyer,et al.  Customer relations management: call center operations: modelling and simulation of a telephone call center , 2003, WSC '03.