We consider an M/M/1 queueing system under the Shortest Remaining Processing Time (SRPT) policy. We show that there are constants c l and c 2 such the average sojourn time under SRPT lies between c l (μ(1 - ρ) log 1/(1 - ρ)) -1 and c 2 (μ(l - ρ) log 1/(1 - ρ)) -1 , where μ denotes the service rate and ρ denotes the load. Comparing this with the classic result that any scheduling policy that does not use the knowledge of job sizes has average sojourn time (μ(1-ρ)) -1 , implies that SRPT offers a non-constant improvement over such policies.
/lp/association-for-computing-machinery/on-the-average-sojourn-time-under-m-m-1-srpt-tXTZm6SvQC