Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks

DOI10.1287/OPRE.45.2.302zbMATH Open0893.90086OpenAlexW2134435031MaRDI QIDQ4367255FDOQ4367255

Prabuddha De, Charles Wells, Jay B. Ghosh, E. James Dunne

Publication date: 25 November 1997

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.45.2.302

Recommendations

• The discrete time-cost tradeoff problem revisited
• Hardness of approximation of the discrete time-cost tradeoff problem
• Optimal procedures for the discrete time/cost trade-off problem in project networks
• The discrete time/cost trade-off problem: Extensions and heuristic procedures
• New computational results on the discrete time/cost trade-off problem in project networks

zbMATH Keywords

time-cost tradeoffstrongly NP-hardproject networksexponential worst-case complexity

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

Cited In (49)

• Robust Capacity Planning for Project Management
• An agency perspective for multi-mode project scheduling with time/cost trade-offs
• Single-machine scheduling with trade-off between number of tardy jobs and compression cost
• Min-Max Regret Version of the Linear Time–Cost Tradeoff Problem with Multiple Milestones and Completely Ordered Jobs
• Approximating the discrete time-cost tradeoff problem with bounded depth
• Approximating the discrete time-cost tradeoff problem with bounded depth
• Work Package Sizing and Project Performance
• Time-cost trade-off analysis of project networks in fuzzy environments
• Project scheduling with irregular costs: complexity, approximability, and algorithms
• Simulated annealing and tabu search for multi-mode project payment scheduling
• Preprocessing the discrete time-cost tradeoff problem with generalized precedence relations
• Solving multi-mode time–cost–quality trade-off problems under generalized precedence relations
• Complexity results for the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs
• Variable neighbourhood search and tabu search for a discrete time/cost trade-off problem to minimize the maximal cash flow gap
• Optimal procedures for the discrete time/cost trade-off problem in project networks
• Bin packing with controllable item sizes
• A float-path theory and its application to the time-cost tradeoff problem
• Generating two-terminal directed acyclic graphs with a given complexity index by constraint logic programming
• A reduction tree approach for the discrete time/cost trade-off problem
• Optimal crashing of an activity network with disruptions
• Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks
• Railway scheduling reduces the expected project makespan over roadrunner scheduling in a multi-mode project scheduling environment
• Resource-constrained project scheduling: Notation, classification, models, and methods
• Robust scheduling and robustness measures for the discrete time/cost trade-off problem
• A linear time-cost tradeoff problem with multiple milestones under a comb graph
• A multi-objective imperialist competitive algorithm for solving discrete time, cost and quality trade-off problems with mode-identity and resource-constrained situations
• Fully Polynomial Time Approximation Schemes for Time-Cost Tradeoff Problems in Series-Parallel Project Networks
• Simulated annealing for financing cost distribution based project payment scheduling from a joint perspective
• A new path-based cutting plane approach for the discrete time-cost tradeoff problem
• An adaptive crashing policy for stochastic time-cost tradeoff problems
• Robust proactive project scheduling model for the stochastic discrete time/cost trade-off problem
• The contractor time–cost–credit trade‐off problem: integer programming model, heuristic solution, and business insights
• 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
• The discrete time/cost trade-off problem: Extensions and heuristic procedures
• A decomposition-based stochastic programming approach for the project scheduling problem under time/cost trade-off settings and uncertain durations
• Discrete time/cost trade-off problem: a decomposition-based solution algorithm for the budget version
• Deadline division-based heuristic for cost optimization in workflow scheduling
• Single-machine scheduling of multiple projects with controllable processing times
• A heuristic procedure for solving the dynamic probabilistic project expediting problem
• Simplifying the nonlinear continuous time-cost tradeoff problem
• Hardness of approximation of the discrete time-cost tradeoff problem
• Minimizing Costs of Resource Requirements in Project Networks Subject to a Fixed Completion Time
• A trade-off between time and cost in scheduling repetitive construction projects
• Multimode resource-constrained project scheduling in flexible projects
• An exact decomposition technique for the deadline-constrained discrete time/cost trade-off problem with discounted cash flows
• A solution procedure for the discrete time, cost and quality tradeoff problem using electromagnetic scatter search
• Title not available (Why is that?)
• On the choice of baseline schedules for the discrete time/resource trade-off problem under stochastic environment

This page was built for publication: Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4367255)