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 language | English |
---|---|
Title of host publication | Approximation, Randomization and Combinatorial Optimization |
Subtitle of host publication | Algorithms and Techniques - 11th International Workshop, APPROX 2008 and 12th International Workshop, RANDOM 2008, Proceedings |
Pages | 91-103 |
Number of pages | 13 |
DOIs | |
State | Published - 2008 |
Externally published | Yes |
Event | 11th 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 2008 → 27 Aug 2008 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 5171 LNCS |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 11th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2008 and 12th International Workshop on Randomization and Computation, RANDOM 2008 |
---|---|
Country/Territory | United States |
City | Boston, MA |
Period | 25/08/08 → 27/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.
Funders | Funder number |
---|---|
National Science Foundation | CMMI-0758069 |
Research Grants Council, University Grants Committee | PolyU5228/08E |
Keywords
- Approximation algorithms
- Project management
- Time-cost tradeoff