Dynamic Scheduling of a Parallel-Server Queueing System: A Computational Method for High-Dimensional Problems
Baris Ata, Ebru Kasikaralar

TL;DR
This paper introduces a neural network-based computational method for real-time skill-based routing in large call centers, effectively handling high-dimensional, heavy-traffic queueing systems.
Contribution
It develops a scalable, simulation-based approach using deep learning to solve high-dimensional diffusion control problems for call center scheduling.
Findings
The method performs at least as well as benchmark policies.
It remains computationally feasible for systems with up to 100 customer classes.
The approach is validated with real call center data.
Abstract
A key operational challenge for call centers is to decide, in real time, which waiting customer should be served by which available agent. This is known as skill-based routing, and the decision becomes especially difficult in large systems with many customer classes, where standard dynamic programming methods can be computationally intractable. Focusing on the Halfin-Whitt heavy-traffic regime and an infinite-horizon discounted cost criterion, we develop a computational method that scales to high-dimensional settings with many customer classes. Our approach begins by deriving an approximating diffusion control problem in the heavy traffic limiting regime. Building on earlier work by Han et al. (2018), we develop a simulation-based method to solve this problem, relying heavily on deep neural network techniques. Using this framework, we construct a policy for the original (prelimit) call…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
