|
|||||
|
|
Fully polynomial-time approximation schemes for time–cost tradeoff problems in series–parallel project networks |
|
| Authors: | Nir Halman Chung-Lun Li David Simchi-Levi |
| Institution: | aDepartment of Civil and Environmental Engineering, Massachusetts Institute of Technology, Cambridge, MA 02139, USA;bSchool of Business Administration, Hebrew University of Jerusalem, Mount Scopus 91905, Israel;cDepartment of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong |
| 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. |
| Keywords: | Project management Time– cost tradeoff Approximation algorithms |
| 本文献已被 ScienceDirect 等数据库收录！ | |