Optimal procedures for the discrete time/cost trade-off problem in project networks

DOI10.1016/0377-2217(94)00181-2zbMath0913.90168OpenAlexW2020690189MaRDI QIDQ1266562

Erik L. Demeulemeester, Salah E. Elmaghraby, Willy S. Herroelen

Publication date: 29 November 1998

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

Full work available at URL: https://lirias.kuleuven.be/handle/123456789/118496

zbMATH Keywords

branch-and-boundproject managementresource constraintsdeterministic activity-on-arc networksdiscrete time/cost trade-off problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items (31)

The discrete time/cost trade-off problem: Extensions and heuristic procedures ⋮ 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 solution procedure for the discrete time, cost and quality tradeoff problem using electromagnetic scatter search ⋮ On the discrete time, cost and quality trade-off problem ⋮ Multimode time-cost-robustness trade-off project scheduling problem under uncertainty ⋮ Improving electromagnetism algorithm for solving resource allocation problem in stochastic networks ⋮ Multi-objective time-cost trade-off in dynamic PERT networks using an interactive approach ⋮ The discrete time-cost tradeoff problem revisited ⋮ Integrated time–cost tradeoff and resources leveling problems with allowed activity splitting ⋮ Optimal workforce assignment to operations of a paced assembly line ⋮ A multi-objective resource allocation problem in dynamic PERT networks ⋮ A heuristic procedure for solving the dynamic probabilistic project expediting problem ⋮ Scheduling projects with heterogeneous resources to meet time and quality objectives ⋮ Time-cost trade-off via optimal control theory in Markov PERT networks ⋮ Generating two-terminal directed acyclic graphs with a given complexity index by constraint logic programming ⋮ A multi-objective resource allocation problem in PERT networks ⋮ 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 ⋮ New computational results for the discrete time/cost trade-off problem with time-switch constraints ⋮ Robust scheduling and robustness measures for the discrete time/cost trade-off problem ⋮ A new path-based cutting plane approach for the discrete time-cost tradeoff problem ⋮ Resource-constrained project scheduling: Notation, classification, models, and methods ⋮ Multimode resource-constrained project scheduling in flexible projects ⋮ Optimal procedures for the discrete time/cost trade-off problem in project networks ⋮ On the use of the complexity index as a measure of complexity in activity networks ⋮ 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 ⋮ The resource constrained project scheduling problem with multiple crashable modes: A heuristic procedure ⋮ A genetic algorithm approach for the time-cost trade-off in PERT networks ⋮ Improving project cost estimation by taking into account managerial flexibility

Cites Work

• An algorithm for hierarchical reduction and decomposition of a directed graph
• On the measurement of complexity in activity networks
• Optimal procedures for the discrete time/cost trade-off problem in project networks
• A Fast Algorithm for the Decomposition of Graphs and Posets
• Optimal Sequencing by Modular Decomposition: Polynomial Algorithms
• Incremental modular decomposition
• Optimal Reduction of Two-Terminal Directed Acyclic Graphs
• A Dynamic Programming Solution to Cost-Time Tradeoff for CPM
• A Random Activity Network Generator
• Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks
• Solving time/cost trade-off problems with discounted cash flows using generalized benders decomposition
• The Theory of Networks and Management Science. Part I
• Optimal design of centralized computer networks

This page was built for publication: Optimal procedures for the discrete time/cost trade-off problem in project networks