A new path-based cutting plane approach for the discrete time-cost tradeoff problem
DOI10.1007/S10287-009-0115-6zbMATH Open1194.90039OpenAlexW2056242985MaRDI QIDQ993703FDOQ993703
Authors: E. Klerides, Eleni Hadjiconstantinou 
Publication date: 20 September 2010
Published in: Computational Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10287-009-0115-6
Recommendations
- New computational results on the discrete time/cost trade-off problem in project networks
- The discrete time-cost tradeoff problem revisited
- Optimal procedures for the discrete time/cost trade-off problem in project networks
- Network decomposition-based benchmark results for the discrete time-cost tradeoff problem
- The discrete time/cost trade-off problem: Extensions and heuristic procedures
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
- Project scheduling. A research handbook.
- Resource-constrained project scheduling: Notation, classification, models, and methods
- Approximation algorithms for the discrete time-cost tradeoff problem
- 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
- Title not available (Why is that?)
- 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
- Decision CPM: Network Reduction and Solution
- A Dynamic Programming Solution to Cost-Time Tradeoff for CPM
- Resource allocation via dynamic programming in activity networks
Cited In (15)
- Solving time-cost trade-off model for activity network by minimum cost flow principle
- Project scheduling with finite or infinite number of activity processing modes -- a survey
- New computational results on the discrete time/cost trade-off problem in project networks
- Preprocessing the discrete time-cost tradeoff problem with generalized precedence relations
- 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 note on time/cost tradeoff curve generation for project scheduling with multi-mode resource availability costs
- Work package sizing and project performance
- An application of randomized minimum cut to the project time/cost tradeoff problem
- 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
- The discrete time/cost trade-off problem: Extensions and heuristic procedures
- Research on discrete time-cost trade-offs problem in project scheduling
- A decomposition-based stochastic programming approach for the project scheduling problem under time/cost trade-off settings and uncertain durations
- Simplifying the nonlinear continuous time-cost tradeoff problem
This page was built for publication: A new path-based cutting plane approach for the discrete time-cost tradeoff problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q993703)
