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

Operations Research Letters

Volumn 33, Issue 2, 2005, Pages 195-200

  Bansal, Nikhil ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Average sojourn time; Heavy traffic; Queueing theory; SRPT

Indexed keywords

INTEGRATION; OPERATIONS RESEARCH; SCHEDULING; THEOREM PROVING;

AVERAGE SOJOURN TIME; HEAVY TRAFFIC; SRPT;

QUEUEING THEORY;

EID: 9644302744     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2004.04.006     Document Type: Article

References (6)

1. R.W. Conway, W.L. Maxwell, L.W. Miller, Theory of Scheduling, Addison-Wesley Publishing Company, Reading, MA, 1967.
2. M. Harchol-Balter, M. Crovella, S. Park, The case for SRPT scheduling in web servers, Technical Report MIT-LCS-TR-767, MIT Lab for Computer Science, October 1998.
3. J. Roberts, L. Massoulié, Bandwidth sharing and admission control for elastic traffic, ITC Specialist Seminar, 1998.
4. L.E. Schrage, A proof of the optimality of the shortest remaining processing time discipline, Oper. Res. 16 (1968) 678-690.
5. L.E. Schrage, L.W. Miller, The queue M/G/1 with the shortest remaining processing time discipline, Oper. Res. 14 (1966) 670-684.
6. F. Schreiber, Properties and applications of the optimal queueing strategy SRPT - a survey, Arch. Elektron. Uebertragungstechnik 47 (1993) 372-378.