Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks
From MaRDI portal
Publication:4367255
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
Cited in
(49)- On the choice of baseline schedules for the discrete time/resource trade-off problem under stochastic environment
- 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
- Time-cost trade-off analysis of project networks in fuzzy environments
- Approximating the discrete time-cost tradeoff problem with bounded depth
- Approximating the discrete time-cost tradeoff problem with bounded depth
- Project scheduling with irregular costs: complexity, approximability, and algorithms
- Simulated annealing and tabu search for multi-mode project payment scheduling
- Complexity results for the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs
- Preprocessing the discrete time-cost tradeoff problem with generalized precedence relations
- Solving multi-mode time–cost–quality trade-off problems under generalized precedence relations
- 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
- Robust capacity planning for project management
- 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 multi-objective imperialist competitive algorithm for solving discrete time, cost and quality trade-off problems with mode-identity and resource-constrained situations
- A linear time-cost tradeoff problem with multiple milestones under a comb graph
- 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
- Work package sizing and project performance
- 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 discrete time/cost trade-off problem: Extensions and heuristic procedures
- 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 contractor time–cost–credit trade‐off problem: integer programming model, heuristic solution, and business insights
- 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
- A heuristic procedure for solving the dynamic probabilistic project expediting problem
- Min-max regret version of the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs
- Simplifying the nonlinear continuous time-cost tradeoff problem
- Single-machine scheduling of multiple projects with controllable processing times
- Hardness of approximation of the discrete time-cost tradeoff problem
- A trade-off between time and cost in scheduling repetitive construction projects
- Minimizing Costs of Resource Requirements in Project Networks Subject to a Fixed Completion Time
- Multimode resource-constrained project scheduling in flexible projects
- A solution procedure for the discrete time, cost and quality tradeoff problem using electromagnetic scatter search
- An exact decomposition technique for the deadline-constrained discrete time/cost trade-off problem with discounted cash flows
- scientific article; zbMATH DE number 7529517 (Why is no real title available?)
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)
