Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
481756 | European Journal of Operational Research | 2009 | 4 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Walid F. Nasrallah,