On the Gittins index in the M/G/1 queue
From MaRDI portal
Publication:2269488
Recommendations
- Properties of the Gittins index with application to optimal scheduling
- On the Gittins index for multistage jobs
- Minimizing the mean slowdown in the M/G/1 queue
- On the optimality of the Gittins index rule for multi-armed bandits with multiple plays
- Almost optimal policies for stochastic systems which almost satisfy conservation laws
Cites work
- scientific article; zbMATH DE number 4087408 (Why is no real title available?)
- scientific article; zbMATH DE number 3761395 (Why is no real title available?)
- scientific article; zbMATH DE number 3562235 (Why is no real title available?)
- scientific article; zbMATH DE number 605729 (Why is no real title available?)
- scientific article; zbMATH DE number 194374 (Why is no real title available?)
- scientific article; zbMATH DE number 5029517 (Why is no real title available?)
- Extensions of the multiarmed bandit problem: The discounted case
- Extremal properties of the FIFO discipline in queueing networks
- Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
- Mathematical problems in the theory of processor-sharing queueing systems
- Multiple feedback at a single-server station
- On extremal service disciplines in single-stage queueing systems
- On optimal right-of-way policies at a single-server station when insertion of idle times is permitted
- On the Gittins index for multiarmed bandits
- On the nonoptimality of the foreground-background discipline for IMRL service times
- Processor-sharing queues: Some progress in analysis
- Recent sojourn time results for multilevel processor‐sharing scheduling disciplines
- Restless Bandits, Linear Programming Relaxations, and a Primal-Dual Index Heuristic
- Scheduling Multiclass Single Server Queueing Systems to Stochastically Maximize the Number of Successful Departures
- Scheduling for Minimum Total Loss Using Service Time Distributions
- Technical Note—A New Proof of the Optimality of the Shortest Remaining Processing Time Discipline
- Time-Sharing Service Systems. I
- Time-Sharing Service Systems. II
Cited in
(16)- Response-adaptive randomization for multi-arm clinical trials using the forward looking Gittins index rule
- SEH: size estimate hedging for single-server queues
- Whittle index approach to multiserver scheduling with impatient customers and DHR service times
- Open problems in queueing theory inspired by datacenter computing
- Optimal timer-based caching policies for general arrival processes
- Minimizing the mean slowdown in the M/G/1 queue
- Approximately optimal scheduling of an \(\mathrm{M}/\mathrm{G}/1\) queue with heavy tails
- OPTIMAL JOB SCHEDULING OF M/GI/1 QUEUE WITH FEEDBACK: THE DISCOUNTED CASE
- Partial flexibility in routeing and scheduling
- Testing indexability and computing Whittle and Gittins index in subcubic time
- SEH: size estimate hedging scheduling of queues
- The \(M/G/1+G\) queue revisited
- Properties of the Gittins index with application to optimal scheduling
- On the Gittins index for multistage jobs
- Minimizing the mean slowdown in a single-server queue
- Whittle index approach to the multi-class queueing systems with convex holding costs and ihr service times
This page was built for publication: On the Gittins index in the M/G/1 queue
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2269488)