Hardness of approximation of the discrete time-cost tradeoff problem

DOI10.1016/S0167-6377(01)00102-XzbMath0993.90060MaRDI QIDQ1604050

Vladimir G. Deǐneko, Gerhard J. Woeginger

Publication date: 3 July 2002

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

approximation algorithmproject managementprecedence constraintsbicriteria optimizationdecision CPM networks

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Management decision making, including multiple objectives (90B50) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Related Items

Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks, The discrete time/cost trade-off problem: Extensions and heuristic procedures, A reduction tree approach for the discrete time/cost trade-off problem, On the discrete time, cost and quality trade-off problem, A multi-objective imperialist competitive algorithm for solving discrete time, cost and quality trade-off problems with mode-identity and resource-constrained situations, Project scheduling with irregular costs: complexity, approximability, and algorithms, Experimental evaluation of simulated annealing algorithms for the time-cost trade-off problem, Network decomposition-based benchmark results for the discrete time-cost tradeoff problem, Approximating the discrete time-cost tradeoff problem with bounded depth, Approximating the discrete time-cost tradeoff problem with bounded depth

Cites Work

• Unnamed Item
• The discrete time-cost tradeoff problem revisited
• Some APX-completeness results for cubic graphs
• Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem
• A Dynamic Programming Solution to Cost-Time Tradeoff for CPM
• Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks