.png){kind=icon}
返回
A quorum queueing system under D-policy
.png){kind=icon}
PRE
AI
DOI：10.1016/S0096-3003(02)00410-1.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider a bulk service queueing system under D-policy. Customers are served in batches of r units if the queue length is not less than r. Otherwise, the server delays the service until the cumulative service times of the customers in the queue first reaches the value D. An ergodicity condition and steady-state probabilities are derived for the system size at a service completion epoch. A decomposition property is checked. Special cases are considered, illustrative examples are provided, and various system characteristics are computed. (C) 2002 Elsevier Inc. All rights reserved.
Keyword:
queue
quorum
D-policy
fluctuation theory
embedded Markov chain
decomposition property
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏分享收藏
没有更多内容
没有更多内容