The steady-state appearance of the M/G/1 queue under the discipline of shortest remaining processing time

DOI10.2307/1427545zbMath0707.60085OpenAlexW2018529633MaRDI QIDQ3488984

R. Schassberger

Publication date: 1990

Published in: Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/1427545

zbMATH Keywords

minimizing steady-state mean flow time

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (8)

Diffusion limits for shortest remaining processing time queues ⋮ Fluid Limits for Multiple-Input Shortest Remaining Processing Time Queues ⋮ Diffusion limits for shortest remaining processing time queues under nonstandard spatial scaling ⋮ Discrete-time \(MAP/G/1/\infty\) system with inversive probabilistic servicing discipline ⋮ Heavy traffic scaling limits for shortest remaining processing time queues with heavy tailed processing time distributions ⋮ BMAP/G/1/\(\infty \) system with last come first served probabilistic priority ⋮ The M/G/1 processor-sharing model: Transient behavior ⋮ Heavy traffic analysis for single-server SRPT and LRPT queues via EDF diffusion limits

This page was built for publication: The steady-state appearance of the M/G/1 queue under the discipline of shortest remaining processing time