The discrete time/cost trade-off problem: Extensions and heuristic procedures
From MaRDI portal
Publication:835571
DOI10.1007/s10951-007-0031-yzbMath1168.90475OpenAlexW2005033223MaRDI QIDQ835571
Dieter Debels, Mario Vanhoucke
Publication date: 28 August 2009
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-007-0031-y
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
A heuristic procedure to solve the project staffing problem with discrete time/resource trade-offs and personnel scheduling constraints ⋮ 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 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 multi-objective imperialist competitive algorithm for solving discrete time, cost and quality trade-off problems with mode-identity and resource-constrained situations ⋮ Multimode time-cost-robustness trade-off project scheduling problem under uncertainty ⋮ Variable neighbourhood search and tabu search for a discrete time/cost trade-off problem to minimize the maximal cash flow gap ⋮ An adaptive crashing policy for stochastic time-cost tradeoff problems ⋮ Project scheduling with finite or infinite number of activity processing modes -- a survey ⋮ A biobjective optimization model for deadline satisfaction in line-of-balance scheduling with work interruptions consideration ⋮ An agency perspective for multi-mode project scheduling with time/cost trade-offs ⋮ Capital- and resource-constrained project scheduling with net present value optimization ⋮ A multi‐agent system for the decentralized resource‐constrained multi‐project scheduling problem ⋮ Using schedule risk analysis with resource constraints for project control ⋮ 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 ⋮ A robust time-cost-quality-energy-environment trade-off with resource-constrained in project management: a case study for a bridge construction project ⋮ Discrete time/cost trade-off problem: a decomposition-based solution algorithm for the budget version ⋮ A decomposed branch-and-price procedure for integrating demand planning in personnel staffing problems ⋮ A computational study of constraint programming approaches for resource-constrained project scheduling with autonomous learning effects
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The discrete time-cost tradeoff problem revisited
- On the measurement of complexity in activity networks
- Optimal procedures for the discrete time/cost trade-off problem in project networks
- Project network models with discounted cash flows a guided tour through recent developments
- Critical path in an activity network with time constraints
- 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
- Hardness of approximation of the discrete time-cost tradeoff problem
- New computational results for the discrete time/cost trade-off problem with time-switch constraints
- Future paths for integer programming and links to artificial intelligence
- Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem
- A Network Flow Computation for Project Cost Curves
- On Maximizing the Net Present Value of a Project Under Renewable Resource Constraints
- 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
- Solving time/cost trade-off problems with discounted cash flows using generalized benders decomposition
- 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
