Abstract
The mathematical model of call center functioning in case of overload is constructed and analyzed. In the model multi-skilled routing based on usage of one group of operators capable of serving simple requests and several groups of experts (consultants) handling more advanced topics is taken into account together with the possibility of request repetition in case of blocking or unsuccessful waiting time. Markov process that describes model functioning is constructed. Main performance measures of interest are defined through the values of stationary probabilities of model’s states. Algorithm of characteristics estimation is suggested based on solving the system of state equations. Expressions that relates introduced performance measures in form of conservation laws are derived. It is shown how to use found relations for quantitative and qualitative analysis of the model functioning. The usage of the model for elimination of call center overload based on reducing of the input flow is considered.
The publication has been prepared with the support of the Russian Foundation for Basic Research, project No. 16-29-09497ofi-m.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Gans, N., Koole, M., Mandelbaum, A.: Telephone call-centers: tutorial, review and research prospects. Manuf. Serv. Manag. 5, 79–141 (2003)
Stolletz, R., Helber, S.: Performance analysis of an inbound call-center with skills-based routing. OR Spectr. 26, 331–352 (2004)
Borst, S., Mandelbaum, A., Reiman, M.I.: Dimensioning large call centers. Oper. Res. 52(1), 17–34 (2004)
Koole, G., Mandelbaum, A.: Queueing models of call centers: an introduction. Ann. Oper. Res. 113(4), 41–59 (2002)
Cezik, M.T., L’Ecuyer, P.: Staffing multiskill call centers via linear programming and simulation. Manag. Sci. 54(2), 310–323 (2008)
Mandelbaum, A., Zeltyn, S.: Staffing many-server queues with impatient customers: constraint satisfaction in call centers. Oper. Res. 57(5), 1189–1205 (2009)
Bhulai, S., Koole, G.: A queueing model for call blending in call centers. IEEE Trans. Autom. Control 48(8), 1434–1438 (2003)
Stepanov, S.N., Stepanov, M.S.: Construction and analysis of a generalized contact center model. Autom. Remote Control 75(11), 1936–1947 (2014)
Stepanov, S.N., Stepanov, M.S.: Algorithms for estimating throughput characteristics in a generalized call center model. Autom. Remote Control 77(7), 1195–1207 (2016)
Aguir, S., Karaesmen, F., Aksin, O.Z., Chauvet, F.: The impact of retrials on call center performance. OR Spectr. 26(3), 353–376 (2004)
Aksin, Z., Armony, M., Mehrotra, A.: The modern call center: a multi- disciplinary perspective on operations management research. Prod. Oper. Manag. 16(6), 665–688 (2007)
Whitt, W.: Engineering solution of a basic call-center model. Manag. Sci. 51(2), 221–235 (2005)
Whitt, W.: Staffing a call center with uncertain arrival rate and absenteeism. Prod. Oper. Manag. 15(1), 88–102 (2006)
Barker, V.A.: Numerical solution of sparse singular systems of equations arising from ergodic Markov chains. Stoch. Models 5(3), 335–381 (1989)
Stepanov, S.N.: Markov models with retrials: the calculation of stationary performance measures based on the concept of truncation. Math. Comput. Model. 30, 207–228 (1999)
Stepanov, S.N.: Generalized model with retrials in case of extreme load. Queueing Syst. 27, 131–151 (1998)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Stepanov, S.N., Stepanov, M.S., Zhurko, H.M. (2019). The Modeling of Call Center Functioning in Case of Overload. In: Vishnevskiy, V., Samouylov, K., Kozyrev, D. (eds) Distributed Computer and Communication Networks. DCCN 2019. Lecture Notes in Computer Science(), vol 11965. Springer, Cham. https://doi.org/10.1007/978-3-030-36614-8_30
Download citation
DOI: https://doi.org/10.1007/978-3-030-36614-8_30
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-36613-1
Online ISBN: 978-3-030-36614-8
eBook Packages: Computer ScienceComputer Science (R0)