Fully polynomial-time approximation schemes for time–cost tradeoff problems in series–parallel project networks

Fully polynomial-time approximation schemes for time–cost tradeoff problems in series–parallel project networks

0.00 Avg rating0 Votes
Article ID: iaor20102970
Volume: 37
Issue: 4
Start Page Number: 239
End Page Number: 244
Publication Date: Jul 2009
Journal: Operations Research Letters
Authors: , ,
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.

Reviews

Required fields are marked *. Your email address will not be published.