.png){kind=icon}
返回
Non-preemptive priority M/M/m queue with servers' vacations
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2021.107390.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider a non-preemptive priority M/M/m queue with two classes of customers and multiple vacations. Service times for all customers are exponentially distributed with the same mean, and vacation times follow an exponential distribution. We obtain the vector probability generating function for the stationary distribution of the number of customers in the queue for each class. This is established by deriving a matrix equation for the vector probability generating function of the stationary distribution of the censored Markov process and then studying the analytical properties of the matrix generating function. We also obtain exact expressions for the first two moments of the number of customers in the queue for each class. Finally, as an application, we investigate a customer's equilibrium strategy and the optimal priority fee associated with social cost minimization for an unobservable M/M/m queue with two priority classes and multiple vacations.
Keyword:
Non-preemptive priority queue
Server vacation
Censored markov process
Equilibrium strategy
Social cost
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
引用论文
.png){kind=icon}
An Image Encryption Algorithm Based on Scrambling and Substitution Using Hybrid Chaotic Systems
PREAI
分享收藏
分享收藏
查看更多内容