Discrete time/cost trade-off problem: a decomposition-based solution algorithm for the budget version
From MaRDI portal
Publication:1040964
DOI10.1016/j.cor.2009.06.009zbMath1175.90168OpenAlexW2102204585MaRDI QIDQ1040964
Erdal Erel, Mohamed Haouari, Öncü Hazır
Publication date: 27 November 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11693/22384
Related Items (11)
The impact of solution representations on heuristic net present value optimization in discrete time/cost trade-off project scheduling with multiple cash flow and payment models ⋮ A hybrid simulation-optimization approach for the robust discrete time/cost trade-off problem ⋮ A reduction tree approach for the discrete time/cost trade-off problem ⋮ A decomposition based solution algorithm for U-type assembly line balancing with interval data ⋮ Multimode time-cost-robustness trade-off project scheduling problem under uncertainty ⋮ Integrated time–cost tradeoff and resources leveling problems with allowed activity splitting ⋮ Project scheduling with finite or infinite number of activity processing modes -- a survey ⋮ An agency perspective for multi-mode project scheduling with time/cost trade-offs ⋮ An updated survey of variants and extensions of the resource-constrained project scheduling problem ⋮ Accelerating Benders decomposition for short-term hydropower maintenance scheduling ⋮ Robust scheduling and robustness measures for the discrete time/cost trade-off problem
Cites Work
- The discrete time/cost trade-off problem: Extensions and heuristic procedures
- The discrete time-cost tradeoff problem revisited
- Partitioning procedures for solving mixed-variables programming problems
- Optimal procedures for the discrete time/cost trade-off problem in project networks
- A survey on Benders decomposition applied to fixed-charge network design problems
- Network decomposition-based benchmark results for the discrete time-cost tradeoff problem
- New computational results on the discrete time/cost trade-off problem in project networks
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Optimal Reduction of Two-Terminal Directed Acyclic Graphs
- A Dynamic Programming Solution to Cost-Time Tradeoff for CPM
- A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
- A Dynamic Programming Algorithm for Decision CPM Networks
- Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks
- A Computational Study of Search Strategies for Mixed Integer Programming
- Solving time/cost trade-off problems with discounted cash flows using generalized benders decomposition
- Finding the K Shortest Loopless Paths in a Network
This page was built for publication: Discrete time/cost trade-off problem: a decomposition-based solution algorithm for the budget version
