How pre-emptive priority affects completion rate in an M/M/1 queue with Poisson reneging
Queuing problems in which customers leave the queue without obtaining service (i.e. renege) have many applications. This paper looks at a queue where arrival, service and reneging events are all generated by independent Poisson processes, and customers are selected for service according to priority....
Saved in:
Published in | European journal of operational research Vol. 193; no. 1; pp. 317 - 320 |
---|---|
Main Author | |
Format | Journal Article |
Language | English |
Published |
Amsterdam
Elsevier B.V
16.02.2009
Elsevier Elsevier Sequoia S.A |
Series | European Journal of Operational Research |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | Queuing problems in which customers leave the queue without obtaining service (i.e. renege) have many applications. This paper looks at a queue where arrival, service and reneging events are all generated by independent Poisson processes, and customers are selected for service according to priority. A closed-form expression is derived for the probability of completing service for each priority class if high-priority customers always pre-empt low-priority ones. This result has applications in modeling the value of communications between members of an interacting population, such as a formal organization or an online community. |
---|---|
ISSN: | 0377-2217 1872-6860 |
DOI: | 10.1016/j.ejor.2007.11.055 |