Queuing with Preemptive Priorities or with Breakdown

Harrison White and Lee S. Christie
Additional contact information
Harrison White: Operations Research Office, The Johns Hopkins University, Bethesda, Maryland
Lee S. Christie: Operations Research Office, The Johns Hopkins University, Bethesda, Maryland

Operations Research, 1958, vol. 6, issue 1, 79-95

Abstract: Preemptive priority is defined and contrasted with head-of-the line priority Poisson arrivals at a single server are assumed throughout, and only steady-state solutions are found. The effect on service-time statistics of preempted items re-entering service according to various rules is considered. A formula for the joint probability distribution of queue lengths of two preemptive priority classes is derived assuming negative exponential service statistics. Moments of this queue length distribution are found by a generating function approach. For any number of preemptive priority classes, expected times-in-system are found for a general service time distribution for each class, and for negative exponential service, with the same rate for each class, the generating functions of the delay distributions are also obtained. The similarity of queuing with breakdown to queuing with preemptive priority is pointed out, and two models of breakdown effects are worked out.

Date: 1958
References: Add references at CitEc
Citations: View citations in EconPapers (15)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.6.1.79 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:6:y:1958:i:1:p:79-95

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().