.png){kind=icon}
返回
A MULTIECHELON QUEUING MODEL WITH DYNAMIC PRIORITY SCHEDULING
.png){kind=icon}
PRE
AI
DOI：10.1016/0377-2217(94)90206-2.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we consider a multiple finite source queueing model with multiple servers and a nonpreemptive dynamic priority service discipline. The model consists of several classes of customers each of which calls for service at the service facility after spending a random amount of time at the source. The service facility has several servers for serving all customer classes. The service time of customers is exponentially distributed. A nonpreemptive dynamic priority service discipline is used by the servers. In this type of scheduling, a customer's priority function value increases linearly with actual waiting time in the queue. We propose a recursive algorithm that approximates the mean waiting time in the queue of each type of customer classes. Although our solution is only approximate, results from a variety of test problems indicate that the approximation is quite accurate.
Keyword:
MARKOV PROCESSES
QUEUES
SCHEDULING
SIMULATION
STOCHASTIC PROCESSES
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
A comprehensive sensor selection method based on energy constraints for cooperative spectrum sensing
PREAI
分享收藏STEADY-STATE APPROXIMATIONS FOR A MULTIECHELON MULTIINDENTURED REPAIRABLE-ITEM INVENTORY SYSTEM
PREAI
分享收藏Deregulated cell death and lymphocyte homeostasis cause premature lethality in mice lacking the BH3-only proteins Bim and Bmf.png)
Blood
OAAI
BloodIF0
OAAI分享收藏
查看更多内容