A two-stage discretionary priority service system with Markovian arrival inputs

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-pree...

Full description

Saved in:
Bibliographic Details
Published in2010 IEEE International Conference on Industrial Engineering and Engineering Management pp. 438 - 442
Main Authors Ning Zhao, Zhaotong Lian
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.12.2010
Subjects
discretionary priority rule
Generators
Markov processes
Matrix decomposition
Priority queue
Probability distribution
Servers
sojourn time
Steady-state
two-stage service
Online AccessGet full text

Cover

More Information
Summary: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.
ISBN:9781424485017
1424485010
ISSN:2157-3611
2157-362X
DOI:10.1109/IEEM.2010.5674486