About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Operations Research Letters
Paper
On the average sojourn time under M/M/1/SRPT
Abstract
We study an M/M/1 queueing system under the shortest remaining processing time (SRPT) policy. We show that the average sojourn time varies as Θ((μ(1-ρ) ln(e/(1-ρ)))-1), where ρ is the system load. Thus, SRPT offers a Θ(ln(e/(1-ρ))) factor improvement over policies that ignore knowledge of job sizes while scheduling. © 2004 Elsevier B.V. All rights reserved.