Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem
From MaRDI portal
Publication:2757572
DOI10.1287/moor.23.4.909zbMath0977.90016OpenAlexW2139411793MaRDI QIDQ2757572
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
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)
Related Items
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 ⋮ Complexity results for the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs ⋮ A float-path theory and its application to the time-cost tradeoff problem ⋮ 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 ⋮ Multimode time-cost-robustness trade-off project scheduling problem under uncertainty ⋮ An adaptive crashing policy for stochastic time-cost tradeoff problems ⋮ Machine scheduling with resource dependent processing times ⋮ A linear time-cost tradeoff problem with multiple milestones under a comb graph ⋮ Scheduling malleable tasks with precedence constraints ⋮ APPROXIMATION ALGORITHMS FOR SCHEDULING MALLEABLE TASKS UNDER PRECEDENCE CONSTRAINTS ⋮ Unnamed Item ⋮ Project scheduling with irregular costs: complexity, approximability, and algorithms ⋮ New computational results for the discrete time/cost trade-off problem with time-switch constraints ⋮ A new path-based cutting plane approach for the discrete time-cost tradeoff problem ⋮ Bin packing with controllable item sizes ⋮ Approximating the discrete time-cost tradeoff problem with bounded depth ⋮ Approximating the discrete time-cost tradeoff problem with bounded depth ⋮ Scheduling jobs with time-resource tradeoff via nonlinear programming ⋮ Simulated annealing and tabu search for multi-mode project payment scheduling ⋮ Optimization of Multi-Threshold Circuits ⋮ Hardness of approximation of the discrete time-cost tradeoff problem
