Abstract
A retrial queueing model is considered with Poisson input and an unlimited number of servers. At any epoch only a finite number of the servers are active, the others are called dormant. An active server is always in one of two possible states, idle or busy. When upon arrival of a customer at least one of the active servers is idle, the newly arrived customer goes into service immediately, making the idle server busy. When at an arrival epoch all active servers are busy, the decision must be made to send the newly arrived customer into orbit, or to activate a dormant server for immediate service of the arrived customer. Customers in orbit try to reenter the system after an exponentially distributed retrial time. At service completion epochs the decision must be made to keep the newly become idle server active, or to make this server dormant. The service times of the customers are independent and have a Coxian-2 distribution. Given specific costs for activating servers, kee** servers active and a holding cost for customers staying in orbit, the problem is when to activate and shut down servers in order to minimize the long-run average cost per unit time. Using Markov decision theory an efficient algorithm is discussed for calculating an optimal policy.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Aguir, S., Karaesmen, F., Aksin, Z., Chauvet, F.: The impact of retrials on call center performance. OR Spectr. 26, 353–376 (2004)
Artalejo, J.R., Gómez-Corral, A.: Retrial Queueing Systems. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-78725-9
Falin, G., Templeton, J.: Retrial Queues. Chapman & Hall, London (1997)
Gans, N., Koole, G., Mandelbaum, A.: Telephone call centers: tutorial, review and research prospects. Manuf. Serv. Oper. Manag. 5, 79–141 (2003)
Garnett, O., Mandelbaum, A., Reiman, M.: Designing a call center with impatient customers. Manuf. Serv. Oper. Manag. 4, 208–227 (2002)
Koole, G., Mandelbaum, A.: Queueing models of call centers, an introduction. Ann. Oper. Res. 113, 41–59 (2002)
Mandelbaum, A., Massey, W., Reiman, M., Stolyar, A., Rider, B.: Queue lengths and waiting times for multiserver queues with abandonment and retrials. Telecommun. Syst. 21, 149–171 (2002)
Mandelbaum, A., Zeltyn, S.: Service engineering in action: the Palm/Erlang-A queue, with applications to call centers. In: Spath, D., Fähnrich, K.P. (eds.) Advances in Services Innovations, pp. 17–45. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-29860-1_2
Nobel, R.D., Bekker, R.: Optimal control for two queues with one switching server. In: Proceedings of the National Conference on Mathematical and Computational Models, PSG College of Technology, Coimbatore, India, pp. 21–33, 27–28 December 2001
Puterman, M.L.: Markov Decision Processes. Wiley, New York (1994)
Tijms, H.C.: A First Course in Stochastic Models. Wiley, New York (2003)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Nobel, R. (2018). A Retrial Queueing System with a Variable Number of Active Servers: Dynamic Manpower Planning in a Call Center. In: Takahashi, Y., Phung-Duc, T., Wittevrongel, S., Yue, W. (eds) Queueing Theory and Network Applications. QTNA 2018. Lecture Notes in Computer Science(), vol 10932. Springer, Cham. https://doi.org/10.1007/978-3-319-93736-6_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-93736-6_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-93735-9
Online ISBN: 978-3-319-93736-6
eBook Packages: Computer ScienceComputer Science (R0)