Some Heavy-Traffic Limit Theorems for a Priority Queue with General Arrivals

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

Operations Research, 1972, vol. 20, issue 2, 381-388

Abstract: This paper considers a single-server queue with two priority classes of customers. Interarrival times and service times for the two classes of customers are assumed to form four mutually independent renewal processes determined by general distributions. In two cases for which a steady state does not exist, limit theorems are obtained for the low-priority waiting time and for the total uncompleted service time of all customers in the system at time t .

Date: 1972
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.20.2.381 (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:381-388

Access Statistics for this article

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