Performance analysis of a call center with interactive voice response units
- 140 Downloads
A Call center may be defined as a service unit where a group of agents handle a large volume of incoming telephone calls for the purpose of sales, service, or other specialized transactions. Typically a call center consists of telephone trunk lines, a switching machine known as the automatic call distributor (ACD) together with a voice response unit (VRU), and telephone sales agents. Customers usually dial a special number provided by the call center; if a trunk line is free, the customer seizes it, otherwise the call is lost. Once the trunk line is seized, the caller is instructed to choose among several options provided by the call center via VRU. After completing the instructions at the VRU, the call is routed to an available agent. If all agents are busy, the call is queued at the ACD until one is free. One of the challenging issues in the design of a call center is the determination of the number of trunk lines and agents required for a given call load and a given service level. Call center industries use the Erlang-C and the Erlang-B formulae in isolation to determine the number of agents and the number of trunk lines needed respectively.
In this paper we propose and analyze a flow controlled network model to capture the role of the VRU as well as the agents. Initially, we assume Poisson arrivals, exponential processing time at the VRU and exponential talk time. This model provides a way to determine the number of trunk lines and agents required simultaneously. An alternative simplified model (that ignores the role of the VRU) will be to use anM|M|S|N queueing model (whereS is the number of agents andN is the number of trunk lines) to determine the optimalS andN subject to service level constraints. We will compare the effectiveness of this simplified model and other approximate methods with our model. We will also point out the drawbacks of using Erlang-C and Erlang-B formulae in isolation.
Key WordsCall center flow controlled Jackson networks Erlang formulae
AMS subject classification60K25
Unable to display preview. Download preview PDF.
- Borst S. and Serri P. (2000). Robust Algorithms for Sharing Agents with Multiples Skills. Preprint.Google Scholar
- Cleveland B. and Mayben J. (1997).Call Center Management on Fast Forward. Call Center Press.Google Scholar
- Garnett O., Mandelbaum A. and Reiman M. (1999). Designing a Call Center with Impatient Customers. Preprint.Google Scholar
- Gross D. and Harris C.MN. (1985).Fundamentals of Queueing Theory. John Wiley.Google Scholar
- Kleinrock L. (1975).Queueing Systems, Volume 1: Theory. John Wiley.Google Scholar
- Koole G. and van der Sluis E. (1998). An optimal Local Search Procedure for Manpower Scheduling in Call Centers, Technical Report WS-501, Vrije Universiteit Amsterdam.http://www.cs.vu.nl/koole/papers/WS501.html Google Scholar
- Talim J. and Koole G. (2000). Exponential Approximation of Multi-Skill Call Centers Architecture, Proceedings of the Queueing Networks with Finite Capacity workshop, Ilkley, West Yorkshire, United Kingdom.Google Scholar