The complexity of optimal queuing network control
From MaRDI portal
Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25) Queues and service in operations research (90B22) Abstract computational complexity for mathematical programming problems (90C60) Optimal stochastic control (93E20)
Recommendations
- The archievable region method in the optimal control of queueing systems; formulations, bounds and policies
- Optimal control of single-server queueing networks
- Control and observation for dynamical queueing networks. II.
- Open bandit processes and optimal scheduling of queueing networks
- Simplified control problems for multiclass many-server queueing systems
Cited in
(57)- Learning, risk attitude and hot stoves in restless bandit problems
- Optimal control of some queueing networks
- Optimal scheduling of multiple sensors over shared channels with packet transmission constraint
- Exponential penalty function control of loss networks
- Index policies for the maintenance of a collection of machines by a set of repairmen
- The archievable region method in the optimal control of queueing systems; formulations, bounds and policies
- Whittle indexability in egalitarian processor sharing systems
- Whittle index based Q-learning for restless bandits with average reward
- Multi-machine preventive maintenance scheduling with imperfect interventions: a restless bandit approach
- Performance optimization for a class of generalized stochastic Petri nets
- Optimal selection of obsolescence mitigation strategies using a restless bandit model
- Dynamic routing in distinguishable parallel queues: an application of product returns for remanufacturing
- Scheduling of multi-class multi-server queueing systems with abandonments
- On the computation of Whittle's index for Markovian restless bandits
- An overview for Markov decision processes in queues and networks
- Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic
- Approximate linear programming for networks: average cost bounds
- Time-Constrained Restless Bandits and the Knapsack Problem for Perishable Items (Extended Abstract)
- Index policies for discounted bandit problems with availability constraints
- Grid Brokering for Batch Allocation Using Indexes
- Sequential scheduling of priority queues and Arm-acquiring bandits
- Algorithms and mechanisms for procuring services with uncertain durations using redundancy
- Whittle’s Index Policy for Multi-Target Tracking with Jamming and Nondetections
- Approximations of the restless bandit problem
- Optimal policies for observing time series and related restless bandit problems
- Resource competition in virtual network embedding
- Scheduling and Control of Queueing Networks
- A restless bandit model for resource allocation, competition, and reservation
- scientific article; zbMATH DE number 7625165 (Why is no real title available?)
- Conditions for indexability of restless bandits and an algorithm to compute Whittle index
- Scalable Reinforcement Learning for Multiagent Networked Systems
- Queueing network controls via deep reinforcement learning
- A verification theorem for threshold-indexability of real-state discounted restless bandits
- Prioritizing hepatitis C treatment in U.S. prisons
- Group maintenance: a restless bandits approach
- Nonstationary bandits with habituation and recovery dynamics
- An Approximation Approach for Response-Adaptive Clinical Trial Design
- Optimally greedy control of team dispatching systems
- An asymptotically optimal heuristic for general nonstationary finite-horizon restless multi-armed, multi-action bandits
- Sensor scheduling for space object tracking and collision alert
- Indexability and optimal index policies for a class of reinitialising restless bandits
- Utility Optimization in Congested Queueing Networks
- Some indexable families of restless bandit problems
- Spinning plates and squad systems: policies for bi-directional restless bandits
- General notions of indexability for queueing control and asset management
- A fluid approach to large volume job shop scheduling
- Exponential asymptotic optimality of Whittle index policy
- A mean field approach for optimization in discrete time
- Low-complexity algorithm for restless bandits with imperfect observations
- On the sensitivity of restless bandits solutions to uncertainty in the models of the arms
- A novel method for generating the optimal routing matrix of queuing networks with batch service
- A restless bandit model for dynamic ride matching with reneging travelers
- Self-organized network flows
- Operation regimes and slower-is-faster-effect in the control of traffic intersections
- Optimal control of fluid restless multi-armed bandits: a machine learning approach
- The power of letting go: scheduling with immediate and delayed rejections in multi-server queues
- Dynamic priority allocation via restless bandit marginal productivity indices
This page was built for publication: The complexity of optimal queuing network control
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2757596)
