A reduction tree approach for the discrete time/cost trade-off problem
From MaRDI portal
Publication:2147020
DOI10.1016/j.cor.2022.105750OpenAlexW4214495982MaRDI QIDQ2147020
Rob Van Eynde, Mario Vanhoucke
Publication date: 22 June 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2022.105750
Cites Work
- Project scheduling with irregular costs: complexity, approximability, and algorithms
- Simulated annealing for financing cost distribution based project payment scheduling from a joint perspective
- The discrete time/cost trade-off problem: Extensions and heuristic procedures
- Robust scheduling and robustness measures for the discrete time/cost trade-off problem
- 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
- On the use of the complexity index as a measure of complexity in activity networks
- Hardness of approximation of the discrete time-cost tradeoff problem
- 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
- Variable neighbourhood search and tabu search for a discrete time/cost trade-off problem to minimize the maximal cash flow gap
- An exact composite lower bound strategy for the resource-constrained project scheduling problem
- An agency perspective for multi-mode project scheduling with time/cost trade-offs
- An integer programming formulation for the project scheduling problem with irregular time-cost tradeoffs
- 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
- Metaheuristics for multi-mode capital-constrained project payment scheduling
- Resource allocation via dynamic programming in activity networks
- An evaluation of the adequacy of project network generators with systematically sampled networks
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
- Multi-mode project payment scheduling problems with bonus-penalty structure
- Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem
- A Network Flow Computation for Project Cost Curves
- Phase transitions in project scheduling
- New computational results on the discrete time/cost trade-off problem in project networks
- A linear-time approximation algorithm for the weighted vertex cover problem
- Optimal Reduction of Two-Terminal Directed Acyclic Graphs
- On the minimum dummy-arc problem
- Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks
- Discrete time/cost trade-offs in project scheduling with time-switch constraints
- Solving time/cost trade-off problems with discounted cash flows using generalized benders decomposition
- Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
- A Theoretical Framework for Instance Complexity of the Resource-Constrained Project Scheduling Problem
This page was built for publication: A reduction tree approach for the discrete time/cost trade-off problem
