Traditional research on routing in queueing systems usually ignores service qual-ity 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 service cus-tomer 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 an MDP formulation to obtain analytical results and insights about the opti-mal 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.
No takes yet. Share an insight, caveat, or question.
A 2005 study studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: