Generalized Restless Bandits and the Knapsack Problem for Perishable Inventories

DOI10.1287/OPRE.2014.1272MaRDI QIDQ2935312zbMATH OpenOpenAlexFDO

Authors Darina Graczová, Peter Jacko

Publication date 22 December 2014

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.2014.1272

zbMATH Keywords

index policiesknapsack problemLagrangian relaxationMarkov decision processesresource allocationWhittle index

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36) Combinatorial optimization (90C27) Markov and semi-Markov decision processes (90C40)

Recommendations

• Time-Constrained Restless Bandits and the Knapsack Problem for Perishable Items (Extended Abstract)
• Approximation algorithms for restless bandit problems
• Approximation algorithms for restless bandit problems
• Approximations of the restless bandit problem
• Improvements and generalizations of stochastic knapsack and Markovian bandits approximation algorithms
• Improvements and generalizations of stochastic knapsack and multi-armed bandit approximation algorithms: extended abstract
• Semi-infinite relaxations for the dynamic knapsack problem with stochastic item sizes
• Generalized Bandit Problems
• Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic
• Per-round knapsack-constrained linear submodular bandits

Cites work

• A generalized Gittins index for a class of multiarmed bandits with general resource requirements
• A model for fresh produce shelf-space allocation and inventory management with freshness-condition-dependent demand
• Approximation algorithms for the stochastic lot-sizing problem with order lead times
• Computing a classic index for finite-horizon bandits
• Dynamic priority allocation via restless bandit marginal productivity indices
• General notions of indexability for queueing control and asset management
• Heuristic, meta-heuristic and hyper-heuristic approaches for fresh produce inventory control and shelf space allocation
• scientific article; zbMATH DE number 4087408 (Why is no real title available?)
• scientific article; zbMATH DE number 3638998 (Why is no real title available?)
• Inventory of multi-deteriorating items sold from two shops under single management with constraints on space and investment
• On an index policy for restless bandits
• Optimal resource allocation for multiqueue systems with a shared server pool
• Recent trends in modeling of deteriorating inventory
• Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic
• Stochastic optimization for real time service capacity allocation under random service demand
• Stocking Retail Assortments Under Dynamic Consumer Substitution
• The theory and practice of revenue management
• Where are the hard knapsack problems?

Cited in

(8)

• Retail store operations: literature review and research directions
• On the computation of Whittle's index for Markovian restless bandits
• Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic
• Time-Constrained Restless Bandits and the Knapsack Problem for Perishable Items (Extended Abstract)
• Group maintenance: a restless bandits approach
• Balancing the profit and capacity under uncertainties: a target‐based distributionally robust knapsack problem
• Index policies for campaign promotion strategies in reward-based crowdfunding
• A restless bandit model for dynamic ride matching with reneging travelers

This page was built for publication: Generalized Restless Bandits and the Knapsack Problem for Perishable Inventories

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2935312)