Stochastic scheduling: a short history of index policies and new approaches to index generation for dynamic resource allocation
From MaRDI portal
Publication:490352
DOI10.1007/S10951-013-0325-1zbMATH Open1305.90212OpenAlexW2022063709MaRDI QIDQ490352FDOQ490352
Publication date: 22 January 2015
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-013-0325-1
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Arm-acquiring bandits
- Algorithms for evaluating the dynamic allocation index
- On the Gittins index for multiarmed bandits
- Restless bandits, partial conservation laws and indexability
- Multi‐Armed Bandit Allocation Indices
- Extensions of the multiarmed bandit problem: The discounted case
- On an index policy for restless bandits
- Conservation Laws, Extended Polymatroids and Multiarmed Bandit Problems; A Polyhedral Approach to Indexable Systems
- Queueing dynamics and maximal throughput scheduling in switched processing systems
- Dynamic resource allocation in a multi-product make-to-stock production system
- The Achievable Region Approach to the Optimal Control of Stochastic Systems
- General notions of indexability for queueing control and asset management
- Dynamic Assortment with Demand Learning for Seasonal Consumer Goods
- The Multi-Armed Bandit Problem: Decomposition and Computation
- A short proof of the Gittins index theorem
- Index policies for the maintenance of a collection of machines by a set of repairmen
- Branching Bandit Processes
- Parallel Scheduling of Multiclass M/M/m Queues: Approximate and Heavy-Traffic Optimization of Achievable Performance
- Time-Sharing Service Systems. I
- Dynamic priority allocation via restless bandit marginal productivity indices
- A generalized Gittins index for a Markov chain and its recursive calculation
- Whittle's index policy for a multi-class queueing system with convex holding costs
- Index-based policies for discounted multi-armed bandits on parallel machines.
- The performance of index-based policies for bandit problems with stochastic machine availability
- Stochastic scheduling with priority classes
- Submodular returns and greedy heuristics for queueing scheduling problems
- Index Policies for the Admission Control and Routing of Impatient Customers to Heterogeneous Service Stations
- Index policies for discounted bandit problems with availability constraints
- Stochastic scheduling with order constraints
- Indexability and Index Heuristics for a Simple Class of Inventory Routing Problems
- Spinning plates and squad systems: policies for bi-directional restless bandits
- Discounted Multiarmed Bandit Problems on a Collection of Machines with Varying Speeds
- The dependence of optimal returns from multi-class queueing systems on their customer base
Cited In (8)
- Journeys in big data statistics
- A conservative index heuristic for routing problems with multiple heterogeneous service facilities
- Optimal activation of halting multi‐armed bandit models
- Single-Visit Policies for Allocating a Single Resource in a Stochastic Environment
- Asymptotically optimal index policies for an abandonment queue with convex holding cost
- Multi-machine preventive maintenance scheduling with imperfect interventions: a restless bandit approach
- On index policies for stochastic minsum scheduling
- Index policies and a novel performance space structure for a class of generalized branching bandit problems
This page was built for publication: Stochastic scheduling: a short history of index policies and new approaches to index generation for dynamic resource allocation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q490352)