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

DOI10.1007/s10287-009-0115-6zbMath1194.90039OpenAlexW2056242985MaRDI QIDQ993703

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 scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10)

Related Items (4)

A hybrid simulation-optimization approach for the robust discrete time/cost trade-off problem ⋮ Project scheduling with finite or infinite number of activity processing modes -- a survey ⋮ Simplifying the nonlinear continuous time-cost tradeoff problem ⋮ A decomposition-based stochastic programming approach for the project scheduling problem under time/cost trade-off settings and uncertain durations

Cites Work

• Unnamed Item
• The discrete time/cost trade-off problem: Extensions and heuristic procedures
• The discrete time-cost tradeoff problem revisited
• Optimal procedures for the discrete time/cost trade-off problem in project networks
• Project scheduling. A research handbook.
• Network decomposition-based benchmark results for the discrete time-cost tradeoff problem
• Resource-constrained project scheduling: Notation, classification, models, and methods
• Resource allocation via dynamic programming in activity networks
• Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem
• New computational results on 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
• A Dynamic Programming Algorithm for Decision CPM Networks
• Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks
• Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems

This page was built for publication: A new path-based cutting plane approach for the discrete time-cost tradeoff problem