Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic

DOI10.1007/s10479-013-1312-9zbMath1348.90619OpenAlexW2172140255MaRDI QIDQ333075

Peter Jacko

Publication date: 9 November 2016

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://eprints.lancs.ac.uk/id/eprint/65371/1/kppi13_springer_aor_rev2.pdf

zbMATH Keywords

Markov decision processesresource allocationknapsack problemretailingrevenue managementWhittle indexperishabilityrestless bandits

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Markov and semi-Markov decision processes (90C40) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (5)

Model and algorithm for container allocation problem with random freight demands in synchromodal transportation ⋮ Generalized Restless Bandits and the Knapsack Problem for Perishable Inventories ⋮ On the computation of Whittle's index for Markovian restless bandits ⋮ Retail store operations: literature review and research directions ⋮ Gradient-Based Adaptive Stochastic Search for Simulation Optimization Over Continuous Space

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• General notions of indexability for queueing control and asset management
• Optimal resource allocation for multiqueue systems with a shared server pool
• Dynamic priority allocation via restless bandit marginal productivity indices
• Arm-acquiring bandits
• Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach
• Where are the hard knapsack problems?
• Index policies for the maintenance of a collection of machines by a set of repairmen
• Stochastic optimization for real time service capacity allocation under random service demand
• Restless bandits, partial conservation laws and indexability
• The Complexity of Optimal Queuing Network Control
• A (2/3)n³ Fast-Pivoting Algorithm for the Gittins Index and Optimal Stopping of a Markov Chain
• Dynamic Portfolio Selection of NPD Programs Using Marginal Returns
• Dynamic Pricing in the Presence of Inventory Considerations: Research Overview, Current Practices, and Future Directions
• Dynamic Assortment with Demand Learning for Seasonal Consumer Goods
• A Generalized Gittins Index for a Class of Multiarmed Bandits with General Resource Requirements
• A forwards induction approach to candidate drug selection
• The cμ rule revisited
• Extensions of the multiarmed bandit problem: The discounted case
• The Multi-Armed Bandit Problem: Decomposition and Computation
• On an index policy for restless bandits
• Dynamic allocation policies for the finite horizon one armed bandit problem
• ASYMPTOTIC BAYES ANALYSIS FOR THE FINITE-HORIZON ONE-ARMED-BANDIT PROBLEM
• Discrete-Variable Extremum Problems

This page was built for publication: Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic