Minimizing the mean slowdown in a single-server queue

DOI10.1007/S11134-022-09777-4zbMath1491.90029OpenAlexW4220941985MaRDI QIDQ2146415

Samuli Aalto

Publication date: 16 June 2022

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

Full work available at URL: https://doi.org/10.1007/s11134-022-09777-4

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Related Items (1)

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

Cites Work

• Unnamed Item
• Size- and state-aware dispatching problem with queue-specific job sizes
• Non-clairvoyant scheduling for minimizing mean slowdown
• On the Gittins index in the M/G/1 queue
• Multi‐Armed Bandit Allocation Indices
• PROPERTIES OF THE GITTINS INDEX WITH APPLICATION TO OPTIMAL SCHEDULING
• 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 a single-server queue