Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks
From MaRDI portal
Publication:833589
DOI10.1016/j.orl.2009.03.002zbMath1167.90510OpenAlexW1978031400MaRDI QIDQ833589
Nir Halman, Chung-Lun Li, David Simchi-Levi
Publication date: 14 August 2009
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2009.03.002
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Related Items (3)
A float-path theory and its application to the time-cost tradeoff problem ⋮ Simplifying the nonlinear continuous time-cost tradeoff problem ⋮ Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier
Cites Work
- Unnamed Item
- Project scheduling with irregular costs: complexity, approximability, and algorithms
- Hardness of approximation of the discrete time-cost tradeoff problem
- Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem
- A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand
- Graph minors. II. Algorithmic aspects of tree-width
- The Recognition of Series Parallel Digraphs
- Approximation Schemes for the Restricted Shortest Path Problem
- Optimal Reduction of Two-Terminal Directed Acyclic Graphs
- A Dynamic Programming Algorithm for Decision CPM Networks
- Approximation algorithms for NP-complete problems on planar graphs
- Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks
- When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
- Optimal design of centralized computer networks
This page was built for publication: Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks
