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

Nir Halman; Chung Lun Li; David Simchi-Levi

doi:10.1016/j.orl.2009.03.002

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

Nir Halman, Chung Lun Li, David Simchi-Levi

Research output: Contribution to journal › Article › peer-review

10 Scopus citations

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.

Original language	English
Pages (from-to)	239-244
Number of pages	6
Journal	Operations Research Letters
Volume	37
Issue number	4
DOIs	https://doi.org/10.1016/j.orl.2009.03.002
State	Published - Jul 2009
Externally published	Yes

Bibliographical note

Funding Information:
This research was supported in part by the Research Grants Council of Hong Kong under grant PolyU5228/08E. The research is also supported by NSF Contract CMMI-0758069.

Keywords

Approximation algorithms
Project management
Time-cost tradeoff

Access to Document

10.1016/j.orl.2009.03.002

Cite this

@article{3e8872d5e1db48a88012afef3e5e5fc4,

title = "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.",

keywords = "Approximation algorithms, Project management, Time-cost tradeoff",

author = "Nir Halman and Li, {Chung Lun} and David Simchi-Levi",

note = "Funding Information: This research was supported in part by the Research Grants Council of Hong Kong under grant PolyU5228/08E. The research is also supported by NSF Contract CMMI-0758069.",

year = "2009",

month = jul,

doi = "10.1016/j.orl.2009.03.002",

language = "אנגלית",

volume = "37",

pages = "239--244",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier",

number = "4",

}

TY - JOUR

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

AU - Halman, Nir

AU - Li, Chung Lun

AU - Simchi-Levi, David

N1 - Funding Information: This research was supported in part by the Research Grants Council of Hong Kong under grant PolyU5228/08E. The research is also supported by NSF Contract CMMI-0758069.

PY - 2009/7

Y1 - 2009/7

N2 - 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.

AB - 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.

KW - Approximation algorithms

KW - Project management

KW - Time-cost tradeoff

UR - http://www.scopus.com/inward/record.url?scp=67449158753&partnerID=8YFLogxK

U2 - 10.1016/j.orl.2009.03.002

DO - 10.1016/j.orl.2009.03.002

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:67449158753

SN - 0167-6377

VL - 37

SP - 239

EP - 244

JO - Operations Research Letters

JF - Operations Research Letters

IS - 4

ER -

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

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this