Minimizing the mean slowdown in the M/G/1 queue

DOI10.1007/s11134-023-09888-6zbMath1523.60146MaRDI QIDQ6063268

Samuli Aalto, Ziv Scully

Publication date: 7 November 2023

Published in: Queueing Systems (Search for Journal in Brave)

zbMATH Keywords

Gittins indexoptimal schedulingM/G/1slowdownFCFSFB

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Stochastic scheduling theory in operations research (90B36) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Unnamed Item
• Size- and state-aware dispatching problem with queue-specific job sizes
• Dynamic priority allocation via restless bandit marginal productivity indices
• Whittle's index policy for a multi-class queueing system with convex holding costs
• Index heuristics for multiclass \(M/G/1\) systems with nonpreemptive service and convex holding costs
• Non-clairvoyant scheduling for minimizing mean slowdown
• Open problems in queueing theory inspired by datacenter computing
• WCFS: a new framework for analyzing multiserver systems
• Minimizing the mean slowdown in a single-server queue
• On the Gittins index in the M/G/1 queue
• PROPERTIES OF THE GITTINS INDEX WITH APPLICATION TO OPTIMAL SCHEDULING
• Preventing Large Sojourn Times Using SMART Scheduling
• Technical Note—A New Proof of the Optimality of the Shortest Remaining Processing Time Discipline
• Deadline Scheduling as Restless Bandits
• Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines
• Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline

This page was built for publication: Minimizing the mean slowdown in the M/G/1 queue