Modelling and solving resource allocation problems via a dynamic programming approach

DOI10.1080/00207179.2019.1661521zbMath1471.91197OpenAlexW2970119659MaRDI QIDQ5157967

Massimo Tipaldi, Ali Forootani, Majid Ghaniee Zarch, Luigi Glielmo, Davide Liuzza

Publication date: 20 October 2021

Published in: International Journal of Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207179.2019.1661521

zbMATH Keywords

Markov chainMarkov decision processstochastic dynamic programmingbirth-death processresource allocation problems

Mathematics Subject Classification ID

Dynamic programming (90C39) Applications of branching processes (60J85) Markov and semi-Markov decision processes (90C40) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (3)

Bellman's principle of optimality and deep reinforcement learning for time-varying tasks ⋮ A Lyapunov-based version of the value iteration algorithm formulated as a discrete-time switched affine system ⋮ Transmission scheduling for multi-process multi-sensor remote estimation via approximate dynamic programming

Uses Software

• Matlab

Cites Work

• Unnamed Item
• Unnamed Item
• Dynamic resource allocation: a flexible and tractable modeling framework
• A simulation based approximate dynamic programming approach to multi-class, multi-resource surgical scheduling
• A Markov decision process model for equitable distribution of supplies under uncertainty
• Optimal dynamic resource allocation to prevent defaults
• A comparison of Monte Carlo tree search and rolling horizon optimization for large-scale dynamic resource allocation problems
• Optimization of hospital ward resources with patient relocation using Markov chain modeling
• Heuristics for the stochastic dynamic task-resource allocation problem with retry opportunities
• A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem
• An approximate dynamic programming approach to resource management in multi-cloud scenarios
• Approximate Dynamic Programming
• A Linearly Relaxed Approximate Linear Program for Markov Decision Processes
• GridSim: a toolkit for the modeling and simulation of distributed resource management and scheduling for Grid computing
• Handbook of Combinatorial Optimization
• Temporal Difference Methods for General Projected Equations

This page was built for publication: Modelling and solving resource allocation problems via a dynamic programming approach