# Optimal balanced control for call centers

Article

First Online:

- 300 Downloads
- 4 Citations

## Abstract

In this paper we study the optimal assignment of tasks to agents in a call center. For this type of problem, typically, no single deterministic and stationary (i.e., state independent and easily implementable) policy yields the optimal control, and mixed strategies are used. Other than finding the optimal mixed strategy, we propose to optimize the performance over the set of “balanced” deterministic periodic non-stationary policies. We provide a stochastic approximation algorithm that allows to find the optimal balanced policy by means of Monte Carlo simulation. As illustrated by numerical examples, the optimal balanced policy outperforms the optimal mixed strategy.

## Keywords

Call center Measure-valued differentiation Balanced sequence Optimization## References

- Altman, E. (1999).
*Constrained Markov decision processes*. London: Chapman & Hall. Google Scholar - Altman, E., Gaujal, B., & Hordijk, A. (2000a). Balanced sequences and optimal routing.
*Journal of the ACM*,*47*, 4. CrossRefGoogle Scholar - Altman, E., Gaujal, B., & Hordijk, A. (2000b). Multimodularity, convexity and optimization properties.
*Mathematics of Operations Research*,*25*(2), 324–347. CrossRefGoogle Scholar - Altman, E., Gaujal, B., & Hordijk, A. (2002). Regular ordering and applications in control policies.
*Discrete Event Dynamic Systems*,*12*(2), 187–210. CrossRefGoogle Scholar - Altman, E., Gaujal, B., & Hordijk, A. (2003).
*Discrete-event control of stochastic networks: multimodularity and regularity*. New York: Springer. CrossRefGoogle Scholar - Altman, E., Gaujal, B., Hordijk, A., & Koole, G. (1998). Optimal admission, routing and service assignment control: the case of single buffer queues. In
*37th IEEE conference on decision and control*, Tampa, FL, USA (Vol. 2, pp. 2119–2124). Google Scholar - Altman, E., & Shwartz, A. (1993). Time-sharing policies for controlled Markov chains.
*Operations Research*,*41*(6), 1116–1124. CrossRefGoogle Scholar - Armony, M., & Maglaras, C. (2004). On customer contact centers with a call-back option: customer decisions, routing rules and system design.
*Operations Research*,*52*, 271–292. CrossRefGoogle Scholar - Bhulai, S., & Koole, G. (2003). A queueing model for call blending in call centers.
*IEEE Transactions on Automatic Control*,*48*, 1434–1438. CrossRefGoogle Scholar - Cao, X. (2007).
*Stochastic learning and optimization: a sensitivity-based approach*. New York: Springer. Google Scholar - Dai, J., & Tezcan, T. (2008). Optimal control of parallel server systems with many servers in heavy traffic.
*Queueing Systems*,*59*, 95–134. CrossRefGoogle Scholar - Feinberg, E. A., & Shwartz, A. (Eds.) (2002).
*Handbook of Markov decision processes*. Norwell: Kluwer Academic. Google Scholar - Franx, G., Koole, G., & Pot, S. (2006). Approximating multi-skill blocking systems by hyperexponential decomposition.
*Performance Evaluation*,*63*(8), 799–824. CrossRefGoogle Scholar - Gans, N., Koole, G., & Mandelbaum, A. (2003). Telephone call centers: tutorial, review, and research prospects.
*Manufacturing & Service Operations Management*,*5*, 79–141. CrossRefGoogle Scholar - Gans, N., & Zhou, Y. (2003). A call-routing problem with service-level constraints.
*Operations Research*,*51*, 255–271. CrossRefGoogle Scholar - Glynn, P. W., & Whitt, W. (1992). The asymptotic efficiency of simulation estimators.
*Operations Research*,*40*(3), 505–520. CrossRefGoogle Scholar - Gurvich, I., Armony, M., & Mandelbaum, A. (2008). Service level differentiation in call centers with fully flexible servers.
*Management Science*,*54*(2), 279–294. CrossRefGoogle Scholar - Hajek, B. (1985). Extremal splittings of point processes.
*Mathematics of Operations Research*,*10*(4), 543–556. CrossRefGoogle Scholar - Hardy, G. H., & Wright, E. M. (1960).
*An introduction to the theory of numbers*(4th ed.). Oxford: Clarendon Press. Google Scholar - Heidergott, B., & Cao, X. R. (2002). A note on the relation between weak derivatives and perturbation realization.
*IEEE Transactions on Automatic Control*,*47*(7), 1112–1115. Google Scholar - Heidergott, B., & Hordijk, A. (2003). Taylor series expansions for stationary Markov chains.
*Advances in Applied Probability*,*23*, 1046–1070. CrossRefGoogle Scholar - Heidergott, B., Hordijk, A., & Weisshaupt, H. (2006). Measure-valued differentiation for stationary Markov chains.
*Mathematics of Operations Research*,*31*(1), 154–172. CrossRefGoogle Scholar - Heidergott, B., & Vázquez-Abad, F. (2006). Measure-valued differentiation for random horizon problems.
*Markov Processes and Related Fields*,*12*, 509–536. Google Scholar - Heidergott, B., & Vázquez-Abad, F. (2008). Measure-valued differentiation for Markov chains.
*Journal of Optimization and Applications*,*136*(2), 187–209. CrossRefGoogle Scholar - Koole, G., & Mandelbaum, A. (2002). Queueing models of call centers: an introduction.
*Annals of Operations Research*,*113*, 41–59. CrossRefGoogle Scholar - Koole, G., & Talim, J. (2000). Exponential approximation of multi-skill call centers architecture. In
*QNETs 2000: fourth international workshop on queueing networks with finite capacity*, Craiglands Hotel, Ilkley, West Yorkshire, UK (pp. 23/1–23/10). Google Scholar - Lothaire, M. (2002).
*Algebraic combinatorics on words*. Cambridge: Cambridge University Press. Google Scholar - Morse, M., & Hedlund, G. (1940). Symbolic dynamics II: Sturmian trajectories.
*American Journal of Mathematics*,*62*, 1–42. CrossRefGoogle Scholar - Perry, M., & Nilsson, A. (1992). Performance modeling of automatic call distributors: assignable grade of service staffing. In
*14th international switching symposium*, Yokohama (pp. 294–298). Google Scholar - Pflug, G. (1996).
*Optimization of stochastic models*. Boston: Kluwer Academic. CrossRefGoogle Scholar - Puterman, M. L. (1994).
*Markov decision processes: discrete stochastic dynamic programming*. New York: Wiley. Google Scholar - Shinya, S., Naoto, M., & Ryohei, K. (2004). m-Balanced words: a generalization of balanced words.
*Theoretical Computer Science*,*314*(1), 97–120. CrossRefGoogle Scholar - Shumsky, R. (2004). Approximation and analysis of a queueing system with flexible and specialized servers.
*OR Spektrum*,*26*, 307–330. CrossRefGoogle Scholar - Stanford, D., & Grassmann, W. (2000). Bilingual server call centers. In D. McDonald & S. Turner (Eds.),
*Fields institute communications: Vol.**208*.*Analysis of communication networks: call centers, traffic and performance*(pp. 31–47). Google Scholar - Wallace, R., & Whitt, W. (2005). A staffing algorithm for call centers with skill-based routing.
*Manufacturing & Service Operations Management*,*7*(4), 276–294. CrossRefGoogle Scholar

## Copyright information

© Springer Science+Business Media, LLC 2012