The Queue M / G /1 with the Semipreemptive-Priority Queuing Discipline

Thomas M. O'Donovan
Additional contact information
Thomas M. O'Donovan: Trinity College, Dublin, Ireland

Operations Research, 1972, vol. 20, issue 2, 434-439

Abstract: This paper studies a priority queuing model in which the processing times of jobs are known upon arrival and preemption without loss of time or processing already accomplished is possible. Jobs are classified into K types according to their lengths, priority is assigned to them according to type and the length of processing remaining, and the paper obtains the expected conditional response times for jobs of each type.

Date: 1972
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.20.2.434 (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:434-439

Access Statistics for this article

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