Virtual allocation policies for many-server queues with abandonment
Virtual allocation policies for many-server queues with abandonment
复制标题
多服务器队列的虚拟分配策略（放弃）
DOI：
10.1007/s00186-019-00683-9
复制
发表时间：
2019
影响因子：
1.2
通讯作者：
Jiheng Zhang
中科院分区：
文献类型：
--
作者：
Zhenghua Long;Jiheng Zhang
研究了一类具有更新到达和一般分布的服务时间和耐心时间的多类多服务台排队系统。系统的状态由一对测度值过程来描述，以跟踪每类客户的剩余服务时间和耐心时间。我们建立流体近似和研究的长期行为的流体模型。流体模型的平衡状态导致一个非线性规划，这使我们能够确定一个长期预期的总持有和放弃成本的下限，并设计一个分配政策，以实现这一下限。通过数值实验证明了该策略的最优性。
We study a multiclass many-server queueing system with renewal arrivals and generally distributed service and patience times under a nonpreemptive allocation policy. The status of the system is described by a pair of measure-valued processes to track the residual service and patience times of customers in each class. We establish fluid approximations and study the long-term behavior of the fluid model. The equilibrium state of the fluid model leads to a nonlinear program, which enables us to identify a lower bound for the long-run expected total holding and abandonment costs and design an allocation policy to achieve this lower bound. The optimality of the proposed policy is also demonstrated via numerical experiments.