运筹学学报 >
2016 , Vol. 20 >Issue 3: 11 - 20
DOI: https://doi.org/10.15960/j.cnki.issn.1007-6093.2016.03.002
对一类等待空间有限的抢占优先权排队的分析
收稿日期: 2015-05-18
网络出版日期: 2016-09-15
基金资助
国家自然科学基金(No. 61174160), 河南省高等学校青年骨干教师基金(No. 2014GGJS-136), 河南省高等学校重点科研项目(No. 16A110002), 河南省教育厅教师教育研究课题(No. 2015JSJYYB118), 河南省大中专就业创业研究课题(No. JYB2015042)
Analysis for a preemptive priority queue with finite capacity
Received date: 2015-05-18
Online published: 2016-09-15
张宏波, 周高军, 封平华 . 对一类等待空间有限的抢占优先权排队的分析[J]. 运筹学学报, 2016 , 20(3) : 11 -20 . DOI: 10.15960/j.cnki.issn.1007-6093.2016.03.002
This paper considers an M/M/1 queue that handles arrivals form 2 classes of customers on a preemptive priority basis, where the lower-priority customers with finite buffering. The queue model can be described in a quasi-birth-and-death (QBD) process with finitely many phases. By matrix-geometric method, we get the formula of stationary queue length distribution, and illustrate the effectiveness of the method by numerical examples.
/
| 〈 |
|
〉 |