Approximation algorithms for the discrete time-cost tradeoff problem

DOI10.1287/MOOR.23.4.909MaRDI QIDQ2757572zbMATH OpenOpenAlexFDO

Authors Martin Skutella

Publication date 26 November 2001

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.23.4.909, https://depositonce.tu-berlin.de/handle/11303/15527

zbMATH Keywords

approximation algorithmbicriteria optimizationschedulingtime-cost tradeoff

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Programming involving graphs or networks (90C35)

Recommendations

• Hardness of approximation of the discrete time-cost tradeoff problem
• Fully Polynomial Time Approximation Schemes for Time-Cost Tradeoff Problems in Series-Parallel Project Networks
• Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks
• The discrete time-cost tradeoff problem revisited
• Network decomposition-based benchmark results for the discrete time-cost tradeoff problem

Cited in

(31)

• Bin packing with controllable item sizes
• Scheduling jobs with time-resource tradeoff via nonlinear programming
• Simulated annealing and tabu search for multi-mode project payment scheduling
• An approximation algorithm for the license and shift class design problem
• Hardness of approximation of the discrete time-cost tradeoff problem
• A hybrid simulation-optimization approach for the robust discrete time/cost trade-off problem
• New computational results for the discrete time/cost trade-off problem with time-switch constraints
• A reduction tree approach for the discrete time/cost trade-off problem
• Multimode time-cost-robustness trade-off project scheduling problem under uncertainty
• A linear time-cost tradeoff problem with multiple milestones under a comb graph
• A discrete EOQ problem is solvable in \(O(\log n)\) time
• Complexity results for the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs
• APPROXIMATION ALGORITHMS FOR SCHEDULING MALLEABLE TASKS UNDER PRECEDENCE CONSTRAINTS
• A float-path theory and its application to the time-cost tradeoff problem
• The Discrete Heal Algorithm With Intermediate Goods
• An adaptive crashing policy for stochastic time-cost tradeoff problems
• Optimization of Multi-Threshold Circuits
• Discrete Time-Cost Tradeoff with a Novel Hybrid Meta-Heuristic
• Scheduling malleable tasks with precedence constraints
• scientific article; zbMATH DE number 1226309 (Why is no real title available?)
• Project scheduling with irregular costs: Complexity, approximability, and algorithms
• scientific article; zbMATH DE number 7529517 (Why is no real title available?)
• Approximating the discrete time-cost tradeoff problem with bounded depth
• Approximating the discrete time-cost tradeoff problem with bounded depth
• Preprocessing the discrete time-cost tradeoff problem with generalized precedence relations
• Project scheduling with irregular costs: complexity, approximability, and algorithms
• Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks
• Single-machine scheduling with trade-off between number of tardy jobs and compression cost
• The discrete time/cost trade-off problem: Extensions and heuristic procedures
• Machine scheduling with resource dependent processing times
• A new path-based cutting plane approach for the discrete time-cost tradeoff problem

This page was built for publication: Approximation algorithms for the discrete time-cost tradeoff problem

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