DocumentCode
1828497
Title
A two-stage discretionary priority service system with Markovian arrival inputs
Author
Zhao, Ning ; Lian, Zhaotong
Author_Institution
Fac. of Bus. Adm., Univ. of Macau, Macau, China
fYear
2010
fDate
7-10 Dec. 2010
Firstpage
438
Lastpage
442
Abstract
We study a two-stage priority service system in which the first stage can be interrupted but the second stage can not. There are two classes of customers, low priority and high priority. The server adopts the preemptive priority discipline if the service is at the first stage and adopts the non-preemptive priority discipline if it is at the second stage service. By treating the high priority queue as bounded, the steady-state probability vector for the system can be expressed in a matrix-geometric form. We also obtain the sojourn time of an arbitrary low priority customer. The numerical results demonstrate the effectiveness of our approach.
Keywords
Markov processes; matrix algebra; queueing theory; Markovian arrival inputs; discretionary priority service system; matrix-geometric form; preemptive priority discipline; steady-state probability vector; Generators; Markov processes; Matrix decomposition; Probability distribution; Servers; Steady-state; Priority queue; discretionary priority rule; sojourn time; two-stage service;
fLanguage
English
Publisher
ieee
Conference_Titel
Industrial Engineering and Engineering Management (IEEM), 2010 IEEE International Conference on
Conference_Location
Macao
ISSN
2157-3611
Print_ISBN
978-1-4244-8501-7
Electronic_ISBN
2157-3611
Type
conf
DOI
10.1109/IEEM.2010.5674486
Filename
5674486
Link To Document