A Dynamic Programming Solution to Cost-Time Tradeoff for CPM
From MaRDI portal
Cited in
(26)- Discrete time/cost trade-off problem: a decomposition-based solution algorithm for the budget version
- Simulated annealing and tabu search for multi-mode project payment scheduling
- The discrete time-cost tradeoff problem revisited
- Optimal procedures for the discrete time/cost trade-off problem in project networks
- Hardness of approximation of the discrete time-cost tradeoff problem
- A hybrid simulation-optimization approach for the robust discrete time/cost trade-off problem
- Improving electromagnetism algorithm for solving resource allocation problem in stochastic networks
- Network decomposition-based benchmark results for the discrete time-cost tradeoff problem
- New computational results for the discrete time/cost trade-off problem with time-switch constraints
- Resource-constrained project scheduling: Notation, classification, models, and methods
- Optimal procedures for dynamic programs with complex loop structures
- Resource allocation via dynamic programming in activity networks
- A solution procedure for the discrete time, cost and quality tradeoff problem using electromagnetic scatter search
- Time-cost trade-off via optimal control theory in Markov PERT networks
- A multi-objective resource allocation problem in PERT networks
- A genetic algorithm approach for the time-cost trade-off in PERT networks
- A decomposition algorithm for nested resource allocation problems
- The contractor time–cost–credit trade‐off problem: integer programming model, heuristic solution, and business insights
- Preprocessing the discrete time-cost tradeoff problem with generalized precedence relations
- Project scheduling with irregular costs: complexity, approximability, and algorithms
- The discrete time/cost trade-off problem: Extensions and heuristic procedures
- On the discrete time, cost and quality trade-off problem
- Multi-objective time-cost trade-off in dynamic PERT networks using an interactive approach
- A multi-objective resource allocation problem in dynamic PERT networks
- A heuristic procedure for solving the dynamic probabilistic project expediting problem
- A new path-based cutting plane approach for the discrete time-cost tradeoff problem
This page was built for publication: A Dynamic Programming Solution to Cost-Time Tradeoff for CPM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4073150)
