Stochastic scheduling: a short history of index policies and new approaches to index generation for dynamic resource allocation

DOI10.1007/s10951-013-0325-1zbMath1305.90212OpenAlexW2022063709MaRDI QIDQ490352

Yong-Cai Geng, Sumit K. Garg

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

zbMATH Keywords

dynamic programmingdynamic resource allocationstochastic schedulingbandit problemsindex policies

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36) Dynamic programming (90C39)

Related Items (6)

Journeys in big data statistics ⋮ Multi-machine preventive maintenance scheduling with imperfect interventions: a restless bandit approach ⋮ Optimal activation of halting multi‐armed bandit models ⋮ A conservative index heuristic for routing problems with multiple heterogeneous service facilities ⋮ On index policies for stochastic minsum scheduling ⋮ Asymptotically optimal index policies for an abandonment queue with convex holding cost

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dynamic resource allocation in a multi-product make-to-stock production system
• General notions of indexability for queueing control and asset management
• Dynamic priority allocation via restless bandit marginal productivity indices
• A generalized Gittins index for a Markov chain and its recursive calculation
• Arm-acquiring bandits
• Algorithms for evaluating the dynamic allocation index
• On the Gittins index for multiarmed bandits
• A short proof of the Gittins index theorem
• Whittle's index policy for a multi-class queueing system with convex holding costs
• Queueing dynamics and maximal throughput scheduling in switched processing systems
• Index policies for the maintenance of a collection of machines by a set of repairmen
• Index-based policies for discounted multi-armed bandits on parallel machines.
• Restless bandits, partial conservation laws and indexability
• 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
• Multi‐Armed Bandit Allocation Indices
• Index Policies for the Admission Control and Routing of Impatient Customers to Heterogeneous Service Stations
• Dynamic Assortment with Demand Learning for Seasonal Consumer Goods
• Branching Bandit Processes
• Index policies for discounted bandit problems with availability constraints
• Parallel Scheduling of Multiclass M/M/m Queues: Approximate and Heavy-Traffic Optimization of Achievable Performance
• Extensions of the multiarmed bandit problem: The discounted case
• The Multi-Armed Bandit Problem: Decomposition and Computation
• On an index policy for restless bandits
• Stochastic scheduling with order constraints
• Time-Sharing Service Systems. I
• Conservation Laws, Extended Polymatroids and Multiarmed Bandit Problems; A Polyhedral Approach to Indexable Systems
• The Achievable Region Approach to the Optimal Control of Stochastic Systems
• 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

This page was built for publication: Stochastic scheduling: a short history of index policies and new approaches to index generation for dynamic resource allocation