Operations Research
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


OPERATIONS RESEARCH
Vol. 53, No. 6, November-December 2005, pp. 968-981
DOI: 10.1287/opre.1050.0230
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by de Véricourt, F.
Right arrow Articles by Zhou, Y.-P.
Right arrow Search for Related Content

Managing Response Time in a Call-Routing Problem with Service Failure

Francis de Véricourt, Yong-Pin Zhou

Fuqua School of Business, Duke University, Durham, North Carolina 27708
University of Washington Business School, Seattle, Washington 98195

fdv1{at}duke.edu
yongpin{at}u.washington.edu

Traditional research on routing in queueing systems usually ignores service quality related factors. In this paper, we analyze the routing problem in a system where customers call back when their problems are not completely resolved by the customer service representatives (CSRs). We introduce the concept of call resolution probability, and we argue that it constitutes a good proxy for call quality. For each call, both the call resolution probability (p) and the average service time (1/µ) are CSR dependent. We use a Markov decision process formulation to obtain analytical results and insights about the optimal routing policy that minimizes the average total time of call resolution, including callbacks. In particular, we provide sufficient conditions under which it is optimal to route to the CSR with the highest call resolution rate (pµ) among those available. We also develop efficient heuristics that can be easily implemented in practice.

Subject classifications: dynamic programming/optimal control; Markov: infinite state; probability: stochastic model applications; queues: Markovian; multichannel.
History: Received April 2003; revision received March 2004; revision received October 2004; revision received November 2004; accepted December 2004.




This article has been cited by other articles:


Home page
MSOMHome page
A. Bassamboo, J. M. Harrison, and A. Zeevi
Pointwise Stationary Fluid Models for Stochastic Processing Networks
MSOM, January 1, 2009; 11(1): 70 - 89.
[Abstract] [PDF]


Home page
Management ScienceHome page
O. Z. Aksin, F. de Vericourt, and F. Karaesmen
Call Center Outsourcing Contract Analysis and Choice
Management Science, February 1, 2008; 54(2): 354 - 368.
[Abstract] [PDF]


Home page
Management ScienceHome page
Z. J. Ren and Y.-P. Zhou
Call Center Outsourcing: Coordinating Staffing Level and Service Quality
Management Science, February 1, 2008; 54(2): 369 - 383.
[Abstract] [PDF]


Home page
Management ScienceHome page
O. Jouini, Y. Dallery, and R. Nait-Abdallah
Analysis of the Impact of Team-Based Organizations in Call Center Management
Management Science, February 1, 2008; 54(2): 400 - 414.
[Abstract] [PDF]


Home page
Operations ResearchHome page
F. de Vericourt and O. B. Jennings
Dimensioning Large-Scale Membership Services
Operations Research, January 1, 2008; 56(1): 173 - 187.
[Abstract] [PDF]




HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2005 by INFORMS.