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.