Preprocessing the discrete time-cost tradeoff problem with generalized precedence relations

Cites Work

Unnamed Item
A multi-objective imperialist competitive algorithm for solving discrete time, cost and quality trade-off problems with mode-identity and resource-constrained situations
Experimental evaluation of simulated annealing algorithms for the time-cost trade-off problem
Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound
The discrete time/cost trade-off problem: Extensions and heuristic procedures
A new path-based cutting plane approach for the discrete time-cost tradeoff problem
Discrete time/cost trade-off problem: a decomposition-based solution algorithm for the budget version
The discrete time-cost tradeoff problem revisited
Optimal procedures for the discrete time/cost trade-off problem in project networks
A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations
Activity-on-node networks with minimal and maximal time lags and their application to make-to-order production
Network scheduling techniques for construction project management
Hardness of approximation of the discrete time-cost tradeoff problem
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
Variable neighbourhood search and tabu search for a discrete time/cost trade-off problem to minimize the maximal cash flow gap
An integer programming formulation for the project scheduling problem with irregular time-cost tradeoffs
Project time-cost analysis under generalised precedence relations
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
Minimizing the completion time of a project under resource constraints and feeding precedence relations: an exact algorithm
A solution procedure for the discrete time, cost and quality tradeoff problem using electromagnetic scatter search
An evaluation of the adequacy of project network generators with systematically sampled networks
Rangen: A random network generator for activity-on-the-node networks
A branch-and-cut algorithm for scheduling of projects with variable-intensity activities
Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem
A Network Flow Computation for Project Cost Curves
New computational results on the discrete time/cost trade-off problem in project networks
Critical-Path Planning and Scheduling: Mathematical Basis
Solving multi-mode time–cost–quality trade-off problems under generalized precedence relations
The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs)
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
Discrete time/cost trade-offs in project scheduling with time-switch constraints
Solving time/cost trade-off problems with discounted cash flows using generalized benders decomposition
Criticality analysis in activity-on-node networks with minimal time lags