Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks
type: Item
instance of: scholarly article
title: Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks
zbMATH Open document ID: 1167.90510
author: Nir Halman
author: Chung-Lun Li
author: David Simchi-Levi
published in: Operations Research Letters
publication date: 2009-08-14T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5595320
zbMATH Keywords: project management
zbMATH Keywords: time-cost tradeoff
zbMATH Keywords: approximation algorithms
MaRDI profile type: Publication
full work available at URL: j.orl.2009.03.002
OpenAlex ID: W1978031400
cites work: Optimal design of centralized computer networks
cites work: Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks
cites work: Approximation algorithms for the discrete time-cost tradeoff problem
cites work: Hardness of approximation of the discrete time-cost tradeoff problem
cites work: Project scheduling with irregular costs: complexity, approximability, and algorithms
cites work: A Dynamic Programming Algorithm for Decision CPM Networks
cites work: When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
cites work: Q3579452
cites work: The Recognition of Series Parallel Digraphs
cites work: A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand
cites work: Graph minors. II. Algorithmic aspects of tree-width
cites work: Approximation algorithms for NP-complete problems on planar graphs
cites work: Approximation Schemes for the Restricted Shortest Path Problem
cites work: Optimal Reduction of Two-Terminal Directed Acyclic Graphs
DOI: 10.1016/J.ORL.2009.03.002
description: scientific article; zbMATH DE number 5595320