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:
Department of Civil and Environmental Engineering, Massachusetts Institute of Technology, Cambridge, MA 02139, USA and School of Business Administration, Hebrew University of Jerusalem, Mount Scop ...;Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong;Department of Civil and Environmental Engineering, Massachusetts Institute of Technology, Cambridge, MA 02139, USA
Venue:
Operations Research Letters
Year:
2009

Citing 8
Cited 1

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
When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?

INFORMS Journal on Computing
Fully polynomial time approximation schemes for stochastic dynamic programs

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand

Mathematics of Operations Research
Hardness of approximation of the discrete time-cost tradeoff problem

Operations Research Letters

Approximating the Nonlinear Newsvendor and Single-Item Stochastic Lot-Sizing Problems When Data Is Given by an Oracle

Operations Research

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.