Article ID: | iaor2008991 |
Country: | United States |
Volume: | 53 |
Issue: | 6 |
Start Page Number: | 968 |
End Page Number: | 981 |
Publication Date: | Nov 2005 |
Journal: | Operations Research |
Authors: | Zhou Yong-Pin, Vricourt Francis de |
Keywords: | programming: dynamic, control processes, markov processes |
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.