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: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

11 Citations (Scopus)

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. © 2009 Elsevier B.V. All rights reserved.

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

Bibliographical note

Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].

Funding

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.

Research Keywords

Approximation algorithms
Project management
Time-cost tradeoff

RGC Funding Information

RGC-funded

Access Output

10.1016/j.orl.2009.03.002

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@article{401504a64d2042fca024b7d62ee7d975,

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. {\textcopyright} 2009 Elsevier B.V. All rights reserved.",

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

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

note = "Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].",

year = "2009",

month = jul,

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

language = "English",

volume = "37",

pages = "239--244",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier B.V.",

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 - Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].

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. © 2009 Elsevier B.V. All rights reserved.

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. © 2009 Elsevier B.V. All rights reserved.

KW - Approximation algorithms

KW - Project management

KW - Time-cost tradeoff

UR - https://www.scopus.com/pages/publications/67449158753

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-67449158753&origin=recordpage

U2 - 10.1016/j.orl.2009.03.002

DO - 10.1016/j.orl.2009.03.002

M3 - RGC 21 - Publication in refereed journal

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

Funding

Research Keywords

RGC Funding Information

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this