2012
DOI: 10.1287/msom.1110.0349
|View full text |Cite
|
Sign up to set email alerts
|

Routing to Manage Resolution and Waiting Time in Call Centers with Heterogeneous Servers

Abstract: I n many call centers, agents are trained to handle all arriving calls but exhibit very different performance for the same call type, where we define performance by both the average call handling time and the call resolution probability. In this paper, we explore strategies for determining which calls should be handled by which agents, where these assignments are dynamically determined based on the specific attributes of the agents and/or the current state of the system. We test several routing strategies usin… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
43
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 35 publications
(43 citation statements)
references
References 27 publications
(26 reference statements)
0
43
0
Order By: Relevance
“…All routing techniques or algorithms used in call distribution follows a baseline routing rule which serves as a benchmark for routing cells [7]. The benchmark routing rule usually followed is the first-come, first serve or longest wait rule.…”
Section: International Journal Of Computer Applications (0975 -8887)mentioning
confidence: 99%
See 1 more Smart Citation
“…All routing techniques or algorithms used in call distribution follows a baseline routing rule which serves as a benchmark for routing cells [7]. The benchmark routing rule usually followed is the first-come, first serve or longest wait rule.…”
Section: International Journal Of Computer Applications (0975 -8887)mentioning
confidence: 99%
“…As adapted from [7], our benchmark routing rule will be the First-Come-First-Served/Longest-Wait (FCFS/LW) rule, which we specify as follows.…”
Section: Definition Of Routing Rulementioning
confidence: 99%
“…Given the complexity of this problem, most papers resort to finding optimal routing policies in large-scale systems under heavy-traffic conditions; e.g., see Armony (2005), Gurvich and Whitt (2009), Armony and Ward (2010), Armony and Mandelbaum (2010), and references therein. Mehrotra et al (2012) resort to a numerical study to characterize overall performance in terms of customer waiting time and overall resolution rate. In general, these papers show that control decisions can actually benefit from agent heterogeneity, e.g., routing incoming calls to the fastest idle agents reduces customer waiting.…”
Section: Background Positioning In the Literature And Contributionsmentioning
confidence: 99%
“…Instead, call centers should offer customers the option to receive a call-back rather than been kept on hold on the queue. In Mehrotra et al (2012), the rules that explicitly emphasize CR rates are:…”
Section: Literature Reviewmentioning
confidence: 99%