New computational results for the discrete time/cost trade-off problem with time-switch constraints

DOI10.1016/j.ejor.2004.04.007zbMath1066.90058OpenAlexW2059453875MaRDI QIDQ1772840

Mario Vanhoucke

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.007

zbMATH Keywords

Project managementCPMTime-switch constraintsTime/cost trade-off problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Management decision making, including multiple objectives (90B50)

Related Items (9)

The discrete time/cost trade-off problem: Extensions and heuristic procedures ⋮ A float-path theory and its application to the time-cost tradeoff problem ⋮ A reduction tree approach for the 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 ⋮ An integer programming formulation for the project scheduling problem with irregular time-cost tradeoffs ⋮ A solution approach to find the critical path in a time-constrained activity network ⋮ Multimode resource-constrained project scheduling in flexible projects ⋮ Simulated annealing and tabu search for multi-mode project payment scheduling

Uses Software

• Visual C++
• RanGen

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The discrete time-cost tradeoff problem revisited
• On the measurement of complexity in activity networks
• An optimal procedure for the resource-constrained project scheduling problem with discounted cash flows and generalized precedence relations
• 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
• Finding the critical path in an activity network with time-switch constraints
• Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem
• A Network Flow Computation for Project Cost Curves
• Phase transitions in project scheduling
• New computational results on the discrete time/cost trade-off problem in project networks
• Critical-Path Planning and Scheduling: Mathematical Basis
• The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs)
• Decision CPM: Network Reduction and Solution
• Note—A Note on “A Simple CPM Time-Cost Tradeoff Algorithm”
• 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
• Optimum Time Compression in Project Scheduling
• A Simple CPM Time-Cost Tradeoff Algorithm
• Critical Path Problems with Concave Cost-Time Curves
• Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems

This page was built for publication: New computational results for the discrete time/cost trade-off problem with time-switch constraints