并行服务器排队系统的动态调度:一种用于高维问题的计算方法
Dynamic Scheduling of a Parallel-Server Queueing System: A Computational Method for High-Dimensional Problems
AI总结:
本文提出一种计算方法,用于解决高维问题中的并行服务器排队系统调度问题,通过深度神经网络技术构建策略,并在大量客户类别下保持计算可行性。
摘要:
呼叫中心面临的关键运营挑战是实时决定应由哪个可用代理服务哪个等待客户。这被称为基于技能的路由,尤其在大型系统中,许多客户类别时决策变得困难,标准动态规划方法计算上不可行。本文聚焦于Halfin-Whitt重负荷 regime和无限时间折扣成本标准,开发了一种可扩展到高维设置的计算方法。我们的方法首先在重负荷极限 regime中推导出近似扩散控制问题。基于Han等人(2018)的先前工作,我们开发了一种基于模拟的方法来解决这个问题,依赖深度神经网络技术。利用该框架,我们构建了原始(预极限)呼叫中心调度问题的策略。为评估性能,我们采用数据驱动的方法。使用来自大型美国银行的呼叫中心数据,我们校准模型并构建现实测试实例。然后我们将结果策略与文献中的基准策略进行比较。在所有考虑过的测试问题中,我们的策略至少与最佳基准策略一样好或更好。此外,该方法在100维以内保持计算可行性,对应于100个或更多不同客户类别的呼叫中心。
英文摘要:
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 center scheduling problem. To evaluate performance, we adopt a data-driven approach. Using call center data from a large U.S. bank, we calibrate the model and construct realistic test instances. We then compare the resulting policy with benchmark policies drawn from the literature. Across all test problems considered so far, our policy performs at least as well as or better than the best benchmark identified. Moreover, the method remains computationally feasible in dimensions up to 100, corresponding to call centers with 100 or more distinct customer classes.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。