Fully polynomial time approximation schemes for time-cost tradeoff problems in series-parallel project networks

Nir Halman, Chung Lun Li, David Simchi-Levi

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationApproximation, Randomization and Combinatorial Optimization
Subtitle of host publicationAlgorithms and Techniques - 11th International Workshop, APPROX 2008 and 12th International Workshop, RANDOM 2008, Proceedings
Pages91-103
Number of pages13
DOIs
StatePublished - 2008
Externally publishedYes
Event11th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2008 and 12th International Workshop on Randomization and Computation, RANDOM 2008 - Boston, MA, United States
Duration: 25 Aug 200827 Aug 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5171 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference11th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2008 and 12th International Workshop on Randomization and Computation, RANDOM 2008
Country/TerritoryUnited States
CityBoston, MA
Period25/08/0827/08/08

Bibliographical note

Funding Information:
This research was supported in part by the Research Grants Council of Hong Kong under grant PolyU5228/08E. The research is also supported by NSF Contract CMMI-0758069.

Funding

This research was supported in part by the Research Grants Council of Hong Kong under grant PolyU5228/08E. The research is also supported by NSF Contract CMMI-0758069.

FundersFunder number
National Science FoundationCMMI-0758069
Research Grants Council, University Grants CommitteePolyU5228/08E

    Keywords

    • Approximation algorithms
    • Project management
    • Time-cost tradeoff

    Fingerprint

    Dive into the research topics of 'Fully polynomial time approximation schemes for time-cost tradeoff problems in series-parallel project networks'. Together they form a unique fingerprint.

    Cite this