Approximate policy iteration for dynamic resource-constrained project scheduling

DOI10.1016/j.orl.2017.06.002zbMath1409.90089OpenAlexW2734696438MaRDI QIDQ1728303

Yasin Gocgun, Archis Ghate, Mahshid Salemi Parizi

Publication date: 22 February 2019

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2017.06.002

zbMATH Keywords

queueingMarkov decision processesapproximate dynamic programming

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40)

Cites Work

• A simulation based approximate dynamic programming approach to multi-class, multi-resource surgical scheduling
• Multi-class, multi-resource advance scheduling with no-shows, cancellations and overbooking
• A survey of variants and extensions of the resource-constrained project scheduling problem
• Scheduling subject to resource constraints: Classification and complexity
• A genetic algorithm for the multidimensional knapsack problem
• Resource-constrained project scheduling: A survey of recent developments.
• Lagrangian relaxation and constraint generation for allocation and advanced scheduling
• \({\mathcal Q}\)-learning
• Dynamic and stochastic multi-project planning
• Relaxations of Weakly Coupled Stochastic Dynamic Programs
• A Q‐Learning‐based method applied to stochastic resource constrained project scheduling with new project arrivals
• Approximate Dynamic Programming
• Scheduling

This page was built for publication: Approximate policy iteration for dynamic resource-constrained project scheduling