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

N. Bansal

doi:10.1016/j.orl.2004.04.006

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

N. Bansal

Research output: Contribution to journal › Article › Academic › peer-review

15 Citations (Scopus)

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 Theta((mu(1-rho)ln(e/(1-rho)))(-1)), where rho is the system load. Thus, SRPT offers a Theta(ln(e/(1-rho))) factor improvement over policies that ignore knowledge of job sizes while scheduling.

Original language	English
Pages (from-to)	195-200
Journal	Operations Research Letters
Volume	33
Issue number	2
DOIs	https://doi.org/10.1016/j.orl.2004.04.006
Publication status	Published - 2005

Access to Document

10.1016/j.orl.2004.04.006

Cite this

@article{daeba3c36aa64eb6808aaf1e6c42a890,

title = "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 Theta((mu(1-rho)ln(e/(1-rho)))(-1)), where rho is the system load. Thus, SRPT offers a Theta(ln(e/(1-rho))) factor improvement over policies that ignore knowledge of job sizes while scheduling.",

author = "N. Bansal",

year = "2005",

doi = "10.1016/j.orl.2004.04.006",

language = "English",

volume = "33",

pages = "195--200",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier B.V.",

number = "2",

}

TY - JOUR

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

AU - Bansal, N.

PY - 2005

Y1 - 2005

N2 - 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 Theta((mu(1-rho)ln(e/(1-rho)))(-1)), where rho is the system load. Thus, SRPT offers a Theta(ln(e/(1-rho))) factor improvement over policies that ignore knowledge of job sizes while scheduling.

AB - 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 Theta((mu(1-rho)ln(e/(1-rho)))(-1)), where rho is the system load. Thus, SRPT offers a Theta(ln(e/(1-rho))) factor improvement over policies that ignore knowledge of job sizes while scheduling.

U2 - 10.1016/j.orl.2004.04.006

DO - 10.1016/j.orl.2004.04.006

M3 - Article

SN - 0167-6377

VL - 33

SP - 195

EP - 200

JO - Operations Research Letters

JF - Operations Research Letters

IS - 2

ER -

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

Abstract

Access to Document

Fingerprint

Cite this