A Priority Queue with Low-Priority Arrivals General

John A. Hooke
Additional contact information
John A. Hooke: Bell Telephone Laboratories, Holmdel, New Jersey

Operations Research, 1972, vol. 20, issue 2, 373-380

Abstract: This paper considers a single-server queue with two priority classes of customers. High-priority arrivals are assumed to be Poisson, but interarrival times for low-priority customers are allowed to have a general distribution. Under either the head-of-the-line or preemptive-resume discipline, a formal solution is obtained for the Laplace-Stieltjes transform of the steady-state distribution of the low-priority waiting time. A limit theorem for the low-priority waiting time is also obtained under one heavy-traffic condition for which a steady state does not exist.

Date: 1972
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.20.2.373 (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:20:y:1972:i:2:p:373-380

Access Statistics for this article

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