Preemptive Resume Priority Queue

N. K. Jaiswal
Additional contact information
N. K. Jaiswal: Operational Research Group, Defence Science Laboratory, Delhi 6, India

Operations Research, 1961, vol. 9, issue 5, 732-742

Abstract: The queue length probability generating function for a preemptive resume priority queue characterized by Poisson arrivals and general service time distributions has been obtained by using the “supplemetary vanable method”. The preempted item follows the “resume” rule so that upon re-entry the service on the nonpriority unit is started at the point where it was interrupted when preemption occurred. Apart from the steady-state solution, the Laplace transform of the time dependent probability generating function and the length of busy periods has also been obtained.

Date: 1961
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.9.5.732 (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:9:y:1961:i:5:p:732-742

Access Statistics for this article

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