Network decomposition-based benchmark results for the discrete time-cost tradeoff problem

DOI10.1016/j.ejor.2004.04.006zbMath1066.90021OpenAlexW1998370163MaRDI QIDQ1772839

Andreas Drexl, Can Akkan, Alf Kimms

Publication date: 21 April 2005

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2004.04.006

zbMATH Keywords

Project schedulingColumn generationActivity networkNetwork decompositionTime-cost tradeoff

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items (19)

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 float-path theory and its application to the time-cost tradeoff problem ⋮ 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 ⋮ Multimode time-cost-robustness trade-off project scheduling problem under uncertainty ⋮ Deadline division-based heuristic for cost optimization in workflow scheduling ⋮ Project scheduling with finite or infinite number of activity processing modes -- a survey ⋮ Simplifying the nonlinear continuous time-cost tradeoff problem ⋮ Branch and bound algorithms for resource constrained project scheduling problem subject to nonrenewable resources with prescheduled procurement ⋮ Generating two-terminal directed acyclic graphs with a given complexity index by constraint logic programming ⋮ Experimental evaluation of simulated annealing algorithms for the time-cost trade-off problem ⋮ A decomposition-based stochastic programming approach for the project scheduling problem under time/cost trade-off settings and uncertain durations ⋮ A survey of variants and extensions of the resource-constrained project scheduling problem ⋮ Robust scheduling and robustness measures for the discrete time/cost trade-off problem ⋮ Maximising the weighted number of activity execution modes in project planning ⋮ A new path-based cutting plane approach for the discrete time-cost tradeoff problem ⋮ Project selection, scheduling and resource allocation with time dependent returns ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The discrete time-cost tradeoff problem revisited
• Optimal procedures for the discrete time/cost trade-off problem in project networks
• Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm
• Hardness of approximation of the discrete time-cost tradeoff problem
• Generating two-terminal directed acyclic graphs with a given complexity index by constraint logic programming
• A Network Flow Computation for Project Cost Curves
• Complexity of the minimum-dummy-activities problem in a pert network
• Critical-Path Planning and Scheduling: Mathematical Basis
• On the computational complexity of the minimum-dummy-activities problem in a pert network
• Optimal Reduction of Two-Terminal Directed Acyclic Graphs
• 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
• Optimal design of centralized computer networks

This page was built for publication: Network decomposition-based benchmark results for the discrete time-cost tradeoff problem