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

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.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 342 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.