On the average sojourn time under \(M/M/1/\)SRPT

DOI10.1016/j.orl.2004.04.006zbMath1099.90014OpenAlexW2033664082MaRDI QIDQ2488224

Nikhil Bansal

Publication date: 25 August 2005

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2004.04.006

zbMATH Keywords

shortest remaining processing timeQueueing theoryHeavy trafficAverage sojourn time

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Related Items (4)

Handling load with less stress ⋮ A large-deviations analysis of the GI/GI/1 SRPT queue ⋮ Heavy-Traffic Analysis of Sojourn Time Under the Foreground–Background Scheduling Policy ⋮ Achievable Performance of Blind Policies in Heavy Traffic

Cites Work

• Unnamed Item
• The Queue M/G/1 with the Shortest Remaining Processing Time Discipline
• Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline

This page was built for publication: On the average sojourn time under \(M/M/1/\)SRPT