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

Cited in

(33)

BMAP/G/1/\(\infty \) system with last come first served probabilistic priority
Limits on stationary queue length under various service disciplines
On reducing time spent in M/G/1 systems
Optimal allocation of priority in a M/M/1 queue with two types of customers
A note on comparing response times in the \(M/GI/1/FB\) and \(M/GI/1/PS\) queues
When random-order-of-service outperforms first-come-first-served
Stationary queuing systems with dependencies
Open problems in queueing theory inspired by datacenter computing
Local edge minimality of SRPT networks with shared resources
Heavy traffic analysis for single-server SRPT and LRPT queues via EDF diffusion limits
Fluid limits for shortest job first with aging
Pricing and distributed QoS control for elastic network traffic
On the average sojourn time under \(M/M/1/\)SRPT
Large deviations of sojourn times in processor sharing queues
Heavy-traffic limits for polling models with exhaustive service and non-FCFS service order policies
Fluid limits for multiple-input shortest remaining processing time queues
scientific article; zbMATH DE number 3723657 (Why is no real title available?)
Size- and state-aware dispatching problem with queue-specific job sizes
Truthful prompt scheduling for minimizing sum of completion times
Open problem: Size-based scheduling with estimation errors
Open problem: \(M/G/k/SRPT\) under medium load
Reducing delay in retrial queues by simultaneously differentiating service and retrial rates
Diffusion limits for shortest remaining processing time queues
Performance of non-cooperative routing over parallel non-observable queues
Discrete-time \(MAP/G/1/\infty\) system with inversive probabilistic servicing discipline
Monotonicity properties for multi-class queueing systems
Instability of LRTF multiclass queueing networks
SEH: size estimate hedging scheduling of queues
Queues with service resetting
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 under nonstandard spatial scaling
Online scheduling policies for multiclass call centers with impatient customers

This page was built for publication: The Queue M/G/1 with the Shortest Remaining Processing Time Discipline

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5524987)