.png){kind=icon}
返回
Multi-server accumulating priority queues with heterogeneous servers
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2016.02.010.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In the present work, we develop a multi-class multi-server queuing model with heterogeneous servers under the accumulating priority queuing discipline, where customers accumulate priority credits as a linear function of their waiting time in the queue, at rates which are distinct to the class to which they belong. At a service completion instant, the customer with the greatest accumulated priority commences service. When the system has more than one idle server, the so-called r-dispatch policy is implemented to determine which of the idle servers is to be selected to serve a newly-arriving customer. We establish the waiting time distribution for each class of customers. We also present a conservation law for the mean waiting time in M/M-i/c systems, and study a cost function in relation to the conservation law to optimize the level of heterogeneity among the service times in M/M-i/2 systems. Numerical investigations through simulation are carried out to validate our model. (C) 2016 Elsevier B.V. All rights reserved.
Keyword:
Queuing
Multi-class accumulating priority queue
Heterogeneous servers
Conservation law
Waiting time distributions
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
.png){kind=icon}
分享收藏
分享收藏Fault Diagnosis of Micro Grid Inverter Based on Wavelet Transform and Probabilistic Neural Network
PREAI
分享收藏
查看更多内容