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.
- Approximation algorithms
- Project management
- Time-cost tradeoff
ASJC Scopus subject areas
- Management Science and Operations Research
- Industrial and Manufacturing Engineering
- Applied Mathematics