The Queue M / G /1 with the Shortest Remaining Processing Time Discipline

Linus E. Schrage and Louis W. Miller
Additional contact information
Linus E. Schrage: Cornell University, Ithaca, New York
Louis W. Miller: The Rand Corporation, Santa Monica, California

Operations Research, 1966, vol. 14, issue 4, 670-684

Abstract: 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 studied. Priority is assigned to jobs according to the length of processing remaining with highest priority going to the job with least processing left. A preemption will occur whenever the processing time of a newly arriving job is less than the remaining processing time of the job then in service. The Laplace-Stieltjes transforms of the waiting time and time-in-system distributions are obtained and comparisons with other queuing disciplines are made.

Date: 1966
References: Add references at CitEc
Citations: View citations in EconPapers (14)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.14.4.670 (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:14:y:1966:i:4:p:670-684

Access Statistics for this article

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