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.
Bibliographical noteFunding 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.
- Approximation algorithms
- Project management
- Time-cost tradeoff