A simple proof of the optimality of a threshold policy in a two-server queueing system
Systems & Control Letters
The Impact of Discharge Decisions on Health Care Quality
Management Science
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Heavy traffic resource pooling in parallel-server systems
Queueing Systems: Theory and Applications
Monotone Control of Queueing Systems with Heterogeneous Servers
Queueing Systems: Theory and Applications
Critical Thresholds for Dynamic Routing in Queueing Networks
Queueing Systems: Theory and Applications
Customer Service Competition in Capacitated Systems
Manufacturing & Service Operations Management
Managing Learning and Turnover in Employee Staffing
Operations Research
Customer Loyalty and Supplier Quality Competition
Management Science
A Call-Routing Problem with Service-Level Constraints
Operations Research
Gatekeepers and Referrals in Services
Management Science
Commissioned Paper: Telephone Call Centers: Tutorial, Review, and Research Prospects
Manufacturing & Service Operations Management
Dimensioning Large Call Centers
Operations Research
Pointwise Stationary Fluid Models for Stochastic Processing Networks
Manufacturing & Service Operations Management
Quality--Speed Conundrum: Trade-offs in Customer-Intensive Services
Management Science
The Labor Illusion: How Operational Transparency Increases Perceived Value
Management Science
Routing to Manage Resolution and Waiting Time in Call Centers with Heterogeneous Servers
Manufacturing & Service Operations Management
Dispatching to incentivize fast service in multi-server queues
ACM SIGMETRICS Performance Evaluation Review
Diagnostic Accuracy Under Congestion
Management Science
| Hi-index | 0.00 |
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.