M. Tismenetsky
International Journal of Computer Mathematics
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.
M. Tismenetsky
International Journal of Computer Mathematics
A. Gupta, R. Gross, et al.
SPIE Advances in Semiconductors and Superconductors 1990
Daniel J. Costello Jr., Pierre R. Chevillat, et al.
ISIT 1997
Moutaz Fakhry, Yuri Granik, et al.
SPIE Photomask Technology + EUV Lithography 2011