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.009zbMATH Open1175.90168OpenAlexW2102204585MaRDI QIDQ1040964FDOQ1040964
Authors: Öncü Hazır, Mohamed Haouari, Erdal Erel 
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
Recommendations
- Research on discrete time-cost trade-offs problem in project scheduling
- A new path-based cutting plane approach for the discrete time-cost tradeoff problem
- Network decomposition-based benchmark results for the discrete time-cost tradeoff problem
- The discrete time-cost tradeoff problem revisited
- A reduction tree approach for the discrete time/cost trade-off problem
Cites Work
- A Computational Study of Search Strategies for Mixed Integer Programming
- Partitioning procedures for solving mixed-variables programming problems
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
- Finding the K Shortest Loopless Paths in a Network
- Optimal Reduction of Two-Terminal Directed Acyclic Graphs
- Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks
- The discrete time-cost tradeoff problem revisited
- Network decomposition-based benchmark results for the discrete time-cost tradeoff problem
- A survey on Benders decomposition applied to fixed-charge network design problems
- New computational results on the discrete time/cost trade-off problem in project networks
- A Dynamic Programming Algorithm for Decision CPM Networks
- The discrete time/cost trade-off problem: Extensions and heuristic procedures
- Optimal procedures for the discrete time/cost trade-off problem in project networks
- Solving time/cost trade-off problems with discounted cash flows using generalized benders decomposition
- A Dynamic Programming Solution to Cost-Time Tradeoff for CPM
Cited In (17)
- An agency perspective for multi-mode project scheduling with time/cost trade-offs
- Project scheduling with finite or infinite number of activity processing modes -- a survey
- Title not available (Why is that?)
- Preprocessing the discrete time-cost tradeoff problem with generalized precedence relations
- 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
- Accelerating Benders decomposition for short-term hydropower maintenance scheduling
- A decomposition based solution algorithm for U-type assembly line balancing with interval data
- A reduction tree approach for the discrete time/cost trade-off problem
- Robust scheduling and robustness measures for the discrete time/cost trade-off problem
- Integrated time–cost tradeoff and resources leveling problems with allowed activity splitting
- Network decomposition-based benchmark results for the discrete time-cost tradeoff problem
- Discrete Time-Cost Tradeoff with a Novel Hybrid Meta-Heuristic
- Research on discrete time-cost trade-offs problem in project scheduling
- Multimode time-cost-robustness trade-off project scheduling problem under uncertainty
- An updated survey of variants and extensions of the resource-constrained project scheduling problem
- An exact decomposition technique for the deadline-constrained discrete time/cost trade-off problem with discounted cash flows
This page was built for publication: Discrete time/cost trade-off problem: a decomposition-based solution algorithm for the budget version
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1040964)
