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.1007/978-3-540-85363-3_8

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: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

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. © 2008 Springer-Verlag Berlin Heidelberg.

Original language	English
Title of host publication	Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques - 11th International Workshop, APPROX 2008 and 12th International Workshop, RANDOM 2008, Proceedings
Pages	91-103
Volume	5171 LNCS
DOIs	https://doi.org/10.1007/978-3-540-85363-3_8
Publication status	Published - 2008
Externally published	Yes
Event	11th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2008 and 12th International Workshop on Randomization and Computation, RANDOM 2008 - Boston, MA, United States Duration: 25 Aug 2008 → 27 Aug 2008

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	5171 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	11th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2008 and 12th International Workshop on Randomization and Computation, RANDOM 2008
Place	United States
City	Boston, MA
Period	25/08/08 → 27/08/08

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

Research Keywords

Approximation algorithms
Project management
Time-cost tradeoff

Access Output

10.1007/978-3-540-85363-3_8

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

Halman, N., Li, C.-L., & Simchi-Levi, D. (2008). Fully polynomial time approximation schemes for time-cost tradeoff problems in series-parallel project networks. In Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques - 11th International Workshop, APPROX 2008 and 12th International Workshop, RANDOM 2008, Proceedings (Vol. 5171 LNCS, pp. 91-103). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5171 LNCS). https://doi.org/10.1007/978-3-540-85363-3_8

Halman, Nir ; Li, Chung-Lun ; Simchi-Levi, David. / Fully polynomial time approximation schemes for time-cost tradeoff problems in series-parallel project networks. Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques - 11th International Workshop, APPROX 2008 and 12th International Workshop, RANDOM 2008, Proceedings. Vol. 5171 LNCS 2008. pp. 91-103 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{83d20a1788a44cc8899d196aff625002,

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} 2008 Springer-Verlag Berlin Heidelberg.",

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].; 11th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2008 and 12th International Workshop on Randomization and Computation, RANDOM 2008 ; Conference date: 25-08-2008 Through 27-08-2008",

year = "2008",

doi = "10.1007/978-3-540-85363-3\_8",

language = "English",

isbn = "3540853626",

volume = "5171 LNCS",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "91--103",

booktitle = "Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques - 11th International Workshop, APPROX 2008 and 12th International Workshop, RANDOM 2008, Proceedings",

}

Halman, N, Li, C-L & Simchi-Levi, D 2008, Fully polynomial time approximation schemes for time-cost tradeoff problems in series-parallel project networks. in Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques - 11th International Workshop, APPROX 2008 and 12th International Workshop, RANDOM 2008, Proceedings. vol. 5171 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5171 LNCS, pp. 91-103, 11th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2008 and 12th International Workshop on Randomization and Computation, RANDOM 2008, Boston, MA, United States, 25/08/08. https://doi.org/10.1007/978-3-540-85363-3_8

Fully polynomial time approximation schemes for time-cost tradeoff problems in series-parallel project networks. / Halman, Nir; Li, Chung-Lun; Simchi-Levi, David.
Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques - 11th International Workshop, APPROX 2008 and 12th International Workshop, RANDOM 2008, Proceedings. Vol. 5171 LNCS 2008. p. 91-103 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5171 LNCS).

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

TY - GEN

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 - 2008

Y1 - 2008

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. © 2008 Springer-Verlag Berlin Heidelberg.

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. © 2008 Springer-Verlag Berlin Heidelberg.

KW - Approximation algorithms

KW - Project management

KW - Time-cost tradeoff

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

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

U2 - 10.1007/978-3-540-85363-3_8

DO - 10.1007/978-3-540-85363-3_8

M3 - RGC 32 - Refereed conference paper (with host publication)

SN - 3540853626

SN - 9783540853626

VL - 5171 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 91

EP - 103

BT - Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques - 11th International Workshop, APPROX 2008 and 12th International Workshop, RANDOM 2008, Proceedings

T2 - 11th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2008 and 12th International Workshop on Randomization and Computation, RANDOM 2008

Y2 - 25 August 2008 through 27 August 2008

ER -

Halman N, Li CL, Simchi-Levi D. Fully polynomial time approximation schemes for time-cost tradeoff problems in series-parallel project networks. In Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques - 11th International Workshop, APPROX 2008 and 12th International Workshop, RANDOM 2008, Proceedings. Vol. 5171 LNCS. 2008. p. 91-103. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-85363-3_8

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

Abstract

Publication series

Conference

Bibliographical note

Research Keywords

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this