The Queue M/G/1 with the Shortest Remaining Processing Time Discipline

DOI10.1287/opre.14.4.670zbMath0147.16702OpenAlexW1979948822MaRDI QIDQ5524987

Louis W. Miller, Linus Schrage

Publication date: 1966

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

Full work available at URL: https://doi.org/10.1287/opre.14.4.670

zbMATH Keywords

probability theory

Related Items

SEH: size estimate hedging for single-server queues ⋮ Heavy-tailed limits for medium size jobs and comparison scheduling ⋮ Diffusion limits for shortest remaining processing time queues ⋮ Limits on stationary queue length under various service disciplines ⋮ Fluid Limits for Multiple-Input Shortest Remaining Processing Time Queues ⋮ Fluid limits for shortest job first with aging ⋮ Monotonicity properties for multi-class queueing systems ⋮ Diffusion limits for shortest remaining processing time queues under nonstandard spatial scaling ⋮ Instability of LRTF multiclass queueing networks ⋮ PERFORMANCE OF NON-COOPERATIVE ROUTING OVER PARALLEL NON-OBSERVABLE QUEUES ⋮ Open Problem—Size-Based Scheduling with Estimation Errors ⋮ Open Problem—M/G/k/SRPT Under Medium Load ⋮ Unnamed Item ⋮ Size- and state-aware dispatching problem with queue-specific job sizes ⋮ On reducing time spent in M/G/1 systems ⋮ Unnamed Item ⋮ A note on comparing response times in the \(M/GI/1/FB\) and \(M/GI/1/PS\) queues ⋮ Reducing Delay in Retrial Queues by Simultaneously Differentiating Service and Retrial Rates ⋮ Pricing and distributed QoS control for elastic network traffic ⋮ Discrete-time \(MAP/G/1/\infty\) system with inversive probabilistic servicing discipline ⋮ On the average sojourn time under \(M/M/1/\)SRPT ⋮ Optimal allocation of priority in a M/M/1 queue with two types of customers ⋮ Large deviations of sojourn times in processor sharing queues ⋮ Heavy-traffic limits for polling models with exhaustive service and non-FCFS service order policies ⋮ When random-order-of-service outperforms first-come-first-served ⋮ Online scheduling policies for multiclass call centers with impatient customers ⋮ Open problems in queueing theory inspired by datacenter computing ⋮ Stationary queuing systems with dependencies ⋮ BMAP/G/1/\(\infty \) system with last come first served probabilistic priority ⋮ Local edge minimality of SRPT networks with shared resources ⋮ Heavy traffic analysis for single-server SRPT and LRPT queues via EDF diffusion limits