On the average sojourn time under M/M/1/SRPT

0.00 Avg rating—0 Votes

Article ID:	iaor20052286
Country:	Netherlands
Volume:	33
Issue:	2
Start Page Number:	195
End Page Number:	200
Publication Date:	Mar 2005
Journal:	Operations Research Letters
Authors:	Bansal Nikhil
Keywords:	scheduling

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 T((μ(1 − ρ) ln(e/(1 − ρ)))^{− 1}), where ρ is the system load. Thus, SRPT offers a T(ln(e/(1 − ρ))) factor improvement over policies that ignore knowledge of job sizes while scheduling.

Reviews

Required fields are marked *. Your email address will not be published.