Stochastic scheduling: a short history of index policies and new approaches to index generation for dynamic resource allocation
type: Item
instance of: scholarly article
title: Stochastic scheduling: a short history of index policies and new approaches to index generation for dynamic resource allocation
zbMATH Open document ID: 1305.90212
author: Yong-Cai Geng
author: Sumit K. Garg
published in: Journal of Scheduling
publication date: 2015-01-22T00:00:00Z
Mathematics Subject Classification ID: 90B36
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 6389296
zbMATH Keywords: bandit problems
zbMATH Keywords: dynamic programming
zbMATH Keywords: dynamic resource allocation
zbMATH Keywords: index policies
zbMATH Keywords: stochastic scheduling
MaRDI profile type: Publication
full work available at URL: s10951-013-0325-1
OpenAlex ID: W2022063709
cites work: Whittle's index policy for a multi-class queueing system with convex holding costs
cites work: Indexability and Index Heuristics for a Simple Class of Inventory Routing Problems
cites work: Queueing dynamics and maximal throughput scheduling in switched processing systems
cites work: Conservation Laws, Extended Polymatroids and Multiarmed Bandit Problems; A Polyhedral Approach to Indexable Systems
cites work: Dynamic Assortment with Demand Learning for Seasonal Consumer Goods
cites work: The dependence of optimal returns from multi-class queueing systems on their customer base
cites work: The Achievable Region Approach to the Optimal Control of Stochastic Systems
cites work: Index policies for discounted bandit problems with availability constraints
cites work: The performance of index-based policies for bandit problems with stochastic machine availability
cites work: Discounted Multiarmed Bandit Problems on a Collection of Machines with Varying Speeds
cites work: Stochastic scheduling with priority classes
cites work: Submodular returns and greedy heuristics for queueing scheduling problems
cites work: Q4197923
cites work: Multi‐Armed Bandit Allocation Indices
cites work: Q4057976
cites work: Stochastic scheduling with order constraints
cites work: General notions of indexability for queueing control and asset management
cites work: Index Policies for the Admission Control and Routing of Impatient Customers to Heterogeneous Service Stations
cites work: Spinning plates and squad systems: policies for bi-directional restless bandits
cites work: Index policies for the maintenance of a collection of machines by a set of repairmen
cites work: Parallel Scheduling of Multiclass M/M/m Queues: Approximate and Heavy-Traffic Optimization of Achievable Performance
cites work: Index-based policies for discounted multi-armed bandits on parallel machines.
cites work: Dynamic resource allocation in a multi-product make-to-stock production system
cites work: The Multi-Armed Bandit Problem: Decomposition and Computation
cites work: Time-Sharing Service Systems. I
cites work: Dynamic priority allocation via restless bandit marginal productivity indices
cites work: Restless bandits, partial conservation laws and indexability
cites work: Q4315289
cites work: Algorithms for evaluating the dynamic allocation index
cites work: A generalized Gittins index for a Markov chain and its recursive calculation
cites work: A short proof of the Gittins index theorem
cites work: Extensions of the multiarmed bandit problem: The discounted case
cites work: On the Gittins index for multiarmed bandits
cites work: On an index policy for restless bandits
cites work: Branching Bandit Processes
cites work: Q3882215
cites work: Arm-acquiring bandits
cites work: Q3815845
DOI: 10.1007/S10951-013-0325-1
description: scientific article; zbMATH DE number 6389296