On the Gittins index in the M/G/1 queue
DOI10.1007/S11134-009-9141-XzbMATH Open1209.90100OpenAlexW2140519736MaRDI QIDQ2269488FDOQ2269488
Authors: Samuli Aalto, Urtzi Ayesta, Rhonda Righter 
Publication date: 17 March 2010
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/20.500.11824/391
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
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Stochastic scheduling theory in operations research (90B36)
Cites Work
- Title not available (Why is that?)
- On the Gittins index for multiarmed bandits
- Extensions of the multiarmed bandit problem: The discounted case
- Title not available (Why is that?)
- Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Processor-sharing queues: Some progress in analysis
- Multiple feedback at a single-server station
- Scheduling for Minimum Total Loss Using Service Time Distributions
- Time-Sharing Service Systems. I
- On extremal service disciplines in single-stage queueing systems
- Extremal properties of the FIFO discipline in queueing networks
- Scheduling Multiclass Single Server Queueing Systems to Stochastically Maximize the Number of Successful Departures
- Technical Note—A New Proof of the Optimality of the Shortest Remaining Processing Time Discipline
- Mathematical problems in the theory of processor-sharing queueing systems
- On the nonoptimality of the foreground-background discipline for IMRL service times
- Restless Bandits, Linear Programming Relaxations, and a Primal-Dual Index Heuristic
- On optimal right-of-way policies at a single-server station when insertion of idle times is permitted
- Time-Sharing Service Systems. II
- Recent sojourn time results for multilevel processor‐sharing scheduling disciplines
Cited In (16)
- OPTIMAL JOB SCHEDULING OF M/GI/1 QUEUE WITH FEEDBACK: THE DISCOUNTED CASE
- Properties of the Gittins index with application to optimal scheduling
- SEH: size estimate hedging for single-server queues
- Whittle index approach to multiserver scheduling with impatient customers and DHR service times
- SEH: size estimate hedging scheduling of queues
- Open problems in queueing theory inspired by datacenter computing
- Partial flexibility in routeing and scheduling
- Minimizing the mean slowdown in the M/G/1 queue
- Minimizing the mean slowdown in a single-server queue
- Optimal timer-based caching policies for general arrival processes
- Approximately optimal scheduling of an \(\mathrm{M}/\mathrm{G}/1\) queue with heavy tails
- Response-adaptive randomization for multi-arm clinical trials using the forward looking Gittins index rule
- Whittle index approach to the multi-class queueing systems with convex holding costs and ihr service times
- Testing indexability and computing Whittle and Gittins index in subcubic time
- On the Gittins index for multistage jobs
- The \(M/G/1+G\) queue revisited
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)
