A new path-based cutting plane approach for the discrete time-cost tradeoff problem

DOI10.1007/S10287-009-0115-6MaRDI QIDQ993703zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

project schedulingcutting planediscrete time-cost tradeoff problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35)

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

Cites work

• scientific article; zbMATH DE number 3661085 (Why is no real title available?)
• A Dynamic Programming Algorithm for Decision CPM Networks
• A Dynamic Programming Solution to Cost-Time Tradeoff for CPM
• Approximation algorithms for the discrete time-cost tradeoff problem
• Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
• Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks
• Decision CPM: Network Reduction and Solution
• 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
• Optimal procedures for the discrete time/cost trade-off problem in project networks
• Project scheduling. A research handbook.
• Resource allocation via dynamic programming in activity networks
• Resource-constrained project scheduling: Notation, classification, models, and methods
• The discrete time-cost tradeoff problem revisited
• The discrete time/cost trade-off problem: Extensions and heuristic procedures

Cited in

(15)

• A hybrid simulation-optimization approach for the robust discrete time/cost trade-off problem
• Research on discrete time-cost trade-offs problem in project scheduling
• Work package sizing and project performance
• Simplifying the nonlinear continuous time-cost tradeoff problem
• 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
• 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
• Solving time-cost trade-off model for activity network by minimum cost flow principle
• A note on time/cost tradeoff curve generation for project scheduling with multi-mode resource availability costs
• The discrete time/cost trade-off problem: Extensions and heuristic procedures
• A decomposition-based stochastic programming approach for the project scheduling problem under time/cost trade-off settings and uncertain durations
• An application of randomized minimum cut to the project time/cost tradeoff problem
• A reduction tree approach for the discrete time/cost trade-off problem
• Preprocessing the discrete time-cost tradeoff problem with generalized precedence relations

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)