Resource allocation via dynamic programming in activity networks
From MaRDI portal
Recommendations
- Optimal resource leveling using non-serial dynamic programming
- Some problems of optimal allocation of scarce resources on a network graph of interdependent activities
- Optimal procedures for the discrete time/cost trade-off problem in project networks
- Optimal control policies for resource allocation in an activity network
- Allocation of resources in project management
Cites work
- scientific article; zbMATH DE number 3599820 (Why is no real title available?)
- scientific article; zbMATH DE number 3449757 (Why is no real title available?)
- scientific article; zbMATH DE number 3225808 (Why is no real title available?)
- A Dynamic Programming Solution to Cost-Time Tradeoff for CPM
- A characterization of network representable polymatroids
- A network flow computation for project cost curves
- Critical Path Problems with Concave Cost-Time Curves
- The Recognition of Series Parallel Digraphs
Cited in
(13)- A stochastic model to control project duration and expenditure
- Optimal resource leveling using non-serial dynamic programming
- A reduction tree approach for the discrete time/cost trade-off problem
- Improving electromagnetism algorithm for solving resource allocation problem in stochastic networks
- Multi-objective time-cost trade-off in dynamic PERT networks using an interactive approach
- The discrete time-cost tradeoff problem revisited
- A new path-based cutting plane approach for the discrete time-cost tradeoff problem
- A review of the contribution of operational research to project management
- Resource planning strategies for healthcare systems during a pandemic
- A multi-objective resource allocation problem in dynamic PERT networks
- A genetic algorithm approach for the time-cost trade-off in PERT networks
- Time-cost trade-off via optimal control theory in Markov PERT networks
- A multi-objective resource allocation problem in PERT networks
This page was built for publication: Resource allocation via dynamic programming in activity networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2366080)