Article ID Journal Published Year Pages File Type
1143110 Operations Research Letters 2009 6 Pages PDF
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 KK-approximation sets and functions, together with series and parallel reductions.

Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Authors
, , ,