Queuing with Nonpreemptive and Preemptive-Resume Priorities

Wei Chang
Additional contact information
Wei Chang: IBM Data Processing Division, Kingston, New York

Operations Research, 1965, vol. 13, issue 6, 1020-1022

Abstract: This paper considers a special queue situation, one in which a single facility serves two major priority classes of customers. Within each class, there are several levels of priorities. The first class has the higher priority. On arrival, a customer of the first class immediately replaces any customer of lower priority being served. The second class has the lower priority, as compared to the first class. On its arrival, a customer of the second class cannot interrupt the current service of a lower priority customer in the system; it must wait until the service is completed. The first class is the preemptive priority, and the second class is the nonpreemptive priority. This paper formulates a theoretical solution for this queuing system, which has a wide range of application in the computer industry. The real-time control program under the multiprogramming environment is an analog of this priority queuing model.

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

Downloads: (external link)
http://dx.doi.org/10.1287/opre.13.6.1020 (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:13:y:1965:i:6:p:1020-1022

Access Statistics for this article

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