@inproceedings{11243fb5a534432a8477d3676078b044,

title = "Fully polynomial time approximation schemes for time-cost tradeoff problems in series-parallel project networks",

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.",

keywords = "Approximation algorithms, Project management, Time-cost tradeoff",

author = "Nir Halman and Li, {Chung Lun} and David Simchi-Levi",

year = "2008",

month = sep,

day = "22",

doi = "10.1007/978-3-540-85363-3_8",

language = "English",

isbn = "3540853626",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "91--103",

booktitle = "Approximation, Randomization and Combinatorial Optimization",

note = "11th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2008 and 12th International Workshop on Randomization and Computation, RANDOM 2008 ; Conference date: 25-08-2008 Through 27-08-2008",

}