Operations Research Transactions ›› 2010, Vol. 14 ›› Issue (2): 61-69.
• Original Articles • Previous Articles Next Articles
LI Gang, ZHANG Hua-Juan
Online:
Published:
Abstract: In this paper, we consider a discrete-time preemptive priority queue with a single server and two types of customers. The stationary probabilities are presented in a matrix form with respect to the background state space. Applying the matrix analytic method, it is shown that certain reasonable conditions lead to a geometric decay of the tail probabilities as the level goes to infinity.
LI Gang, ZHANG Hua-Juan. Analysis of a Discrete-Time Preemptive Priority Queue[J]. Operations Research Transactions, 2010, 14(2): 61-69.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://www.ort.shu.edu.cn/EN/
https://www.ort.shu.edu.cn/EN/Y2010/V14/I2/61