Document Information
The queue M/G/1 with shortest remaining processing time discipline
A priority queueing model in which the processing times of jobs are known upon arrival and preemption without loss of time or processing is already accomplished. 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 occurs whenever the processing time of 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 queueing disciplines are made. 27 pp. Bibliog.
Support RAND Research — Buy This Product!
Paperback Cover Price: $20.00
Discounted Web Price: $18.00
Pages: 30
This product is part of the RAND paper series. The paper was a product of the RAND Corporation from 1948 to 2003 that captured speeches, memorials, and derivative research, usually prepared on authors' own time and meant to be the scholarly or scientific contribution of individual authors to their professional fields. Papers were less formal than reports and did not require rigorous peer review.
The RAND Corporation is a nonprofit research organization providing objective analysis and effective solutions that address the challenges facing the public and private sectors around the world. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.
Top
RAND® is a registered trademark. Copyright © 1994-2009 RAND Corporation. Last Modified: December 07, 2007 