On the Gittins index in the M/G/1 queue
From MaRDI portal
Publication:2269488
DOI10.1007/s11134-009-9141-xzbMath1209.90100OpenAlexW2140519736MaRDI QIDQ2269488
Urtzi Ayesta, Samuli Aalto, 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
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)
Related Items (11)
SEH: size estimate hedging for single-server queues ⋮ Minimizing the mean slowdown in a single-server queue ⋮ Optimal timer-based caching policies for general arrival processes ⋮ Minimizing the mean slowdown in the M/G/1 queue ⋮ Testing indexability and computing Whittle and Gittins index in subcubic time ⋮ Response‐adaptive randomization for multi‐arm clinical trials using the forward looking Gittins index rule ⋮ Open problems in queueing theory inspired by datacenter computing ⋮ PROPERTIES OF THE GITTINS INDEX WITH APPLICATION TO OPTIMAL SCHEDULING ⋮ Partial Flexibility in Routeing and Scheduling ⋮ On the Gittins index for multistage jobs ⋮ Approximately optimal scheduling of an \(\mathrm{M}/\mathrm{G}/1\) queue with heavy tails
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Processor-sharing queues: Some progress in analysis
- Mathematical problems in the theory of processor-sharing queueing systems
- On the Gittins index for multiarmed bandits
- Multiple feedback at a single-server station
- On optimal right-of-way policies at a single-server station when insertion of idle times is permitted
- Scheduling for Minimum Total Loss Using Service Time Distributions
- On the nonoptimality of the foreground-background discipline for IMRL service times
- Scheduling Multiclass Single Server Queueing Systems to Stochastically Maximize the Number of Successful Departures
- On extremal service disciplines in single-stage queueing systems
- Recent sojourn time results for multilevel processor‐sharing scheduling disciplines
- Extensions of the multiarmed bandit problem: The discounted case
- Time-Sharing Service Systems. II
- Extremal properties of the FIFO discipline in queueing networks
- Technical Note—A New Proof of the Optimality of the Shortest Remaining Processing Time Discipline
- Time-Sharing Service Systems. I
- Restless Bandits, Linear Programming Relaxations, and a Primal-Dual Index Heuristic
- Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
This page was built for publication: On the Gittins index in the M/G/1 queue
