Dynamic priority allocation via restless bandit marginal productivity indices (Q926578)

scientific article

Language	Label	Description	Also known as
English	Dynamic priority allocation via restless bandit marginal productivity indices	scientific article

Statements

instance of

scholarly article

0 references

title

Dynamic priority allocation via restless bandit marginal productivity indices (English)

0 references

0 references

0 references

20 May 2008

0 references

zbMATH Keywords

index policies

0 references

restless bandits

0 references

marginal productivity index

0 references

indexability

0 references

dynamic control of queues

0 references

control by price

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s11750-007-0025-0

0 references

cites work

Combining make to order and make to stock

0 references

Optimal priority assignment: a time sharing approach

0 references

Optimality of monotonic policies for two-action Markovian decision processes, with applications to control of queues with delayed information

0 references

Multi-armed bandits with switching penalties

0 references

ON PARALLEL QUEUING WITH RANDOM SERVER CONNECTIVITY AND ROUTING CONSTRAINTS

0 references

Switching Costs and the Gittins Index

0 references

Q3240573

0 references

Conservation Laws, Extended Polymatroids and Multiarmed Bandit Problems; A Polyhedral Approach to Indexable Systems

0 references

Discrete Dynamic Programming

0 references

Q4352278

0 references

On Sequential Designs for Maximizing the Sum of $n$ Observations

0 references

Optimal intensity control of a queueing system with state-dependent capacity limit

0 references

A Characterization of Waiting Time Performance Realizable by Single-Server Queues

0 references

Optimization of static traffic allocation policies

0 references

On the optimal assignment of servers and a repairman

0 references

Numerical linear algebra algorithms and software

0 references

Optimal hysteresis for a class of deterministic deteriorating two-armed bandit problem with switching costs.

0 references

Characterization and Optimization of Achievable Performance in General Queueing Systems

0 references

Q4197923

0 references

Q4692329

0 references

A relation between stationary queue and waiting time distributions

0 references

A multiobjective control approach to priority queues

0 references

On the Optimality of the Generalized Shortest Queue Policy

0 references

Optimality of the shortest line discipline with state-dependent service rates

0 references

Two approaches to optimal routing and admission control in systems with real-time traffic

0 references

A distributional form of Little's law

0 references

Multi-armed bandits with discount factor near one: The Bernoulli case

0 references

Beyond the $c\mu$ rule: Dynamic scheduling of a two-class loss queue

0 references

A conservation law for a wide class of queueing disciplines

0 references

Q4101255

0 references

Time-Sharing Service Systems. I

0 references

Joining the right queue: a state-dependent decision rule

0 references

ON THE OPTIMALITY OF AN INDEX RULE IN MULTICHANNEL ALLOCATION FOR SINGLE-HOP MOBILE NETWORKS WITH MULTIPLE SERVICE CLASSES

0 references

Restless bandits, partial conservation laws and indexability

0 references

Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach

0 references

Restless Bandit Marginal Productivity Indices, Diminishing Returns, and Optimal Control of Make-to-Order/Make-to-Stock M/G/1 Queues

0 references

Marginal productivity index policies for scheduling a multiclass delay-/loss-sensitive queue

0 references

A (2/3)n3 Fast-Pivoting Algorithm for the Gittins Index and Optimal Stopping of a Markov Chain

0 references

Marginal Productivity Index Policies for Admission Control and Routing to Parallel Multi-server Loss Queues with Reneging

0 references

A Faster Index Algorithm and a Computational Study for Bandits with Switching Costs

0 references

The Complexity of Optimal Queuing Network Control

0 references

Dynamic Scheduling Rules for a Multiproduct Make-to-Stock Queue

0 references

Q4315289

0 references

Scheduling with Random Service Times

0 references

Scheduling for Minimum Total Loss Using Service Time Distributions

0 references

Multiclass Queueing Systems: Polymatroidal Structure and Optimal Scheduling Control

0 references

On the duality between routing and scheduling systems with finite buffer space

0 references

Optimal control of admission to a quenching system

0 references

Dynamic server allocation to parallel queues with randomly varying connectivity

0 references

Extensions of the multiarmed bandit problem: The discounted case

0 references

Scheduling a Make-To-Stock Queue: Index Policies and Hedging Points

0 references

ERROR BOUNDS FOR CALCULATION OF THE GITTINS INDICES

0 references

Optimal Server Allocation to Parallel Queues with Finite-Capacity Buffers

0 references

On the Gittins index for multiarmed bandits

0 references

On an index policy for restless bandits

0 references

Addendum to ‘On an index policy for restless bandits'

0 references

Dynamic Scheduling of a Multiclass Make-to-Stock Queue

0 references

Q3882215

0 references

Q3815845

0 references

Q4339077

0 references

Optimality of the shortest line discipline

0 references

Identifiers

zbMATH Open document ID

1142.90015

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

10.1007/S11750-007-0025-0

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:926578