Fully Polynomial Time Approximation Schemes for Time-Cost Tradeoff Problems in Series-Parallel Project Networks

Authors:
Nir Halman;Chung-Lun Li;David Simchi-Levi
Affiliations:
Institute for Advanced Study, Princeton, NJ, and Massachusetts Institute of Technology, , Cambridge;The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong;Massachusetts Institute of Technology, , Cambridge
Venue:
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Year:
2008

Citing 5
Cited 0

Optimal reduction of two-terminal directed acyclic graphs

SIAM Journal on Computing
Approximation schemes for the restricted shortest path problem

Mathematics of Operations Research
Approximation algorithms for NP-complete problems on planar graphs

Journal of the ACM (JACM)
Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem

Mathematics of Operations Research
Fully polynomial time approximation schemes for stochastic dynamic programs

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the deadline problem and budget problem of the nonlinear time-cost tradeoff project scheduling model in a series-parallel activity network. We develop fully polynomial time approximation schemes for both problems using K-approximation sets and functions, together with series and parallel reductions.