Hardness of approximation of the discrete time-cost tradeoff problem

V.G. Deineko; G.J. Woeginger

doi:10.1016/S0167-6377(01)00102-X

Hardness of approximation of the discrete time-cost tradeoff problem

V.G. Deineko
, G.J. Woeginger

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

35 Citations (Scopus)

Abstract

We consider the discrete version of the well-known time-cost tradeoff problem for project networks, which has been extensively studied in the project management literature. We prove a strong in-approximability result with respect to polynomial time bicriteria approximation algorithms for this problem.

Original language	English
Pages (from-to)	207-210
Journal	Operations Research Letters
Volume	29
Issue number	5
DOIs	https://doi.org/10.1016/S0167-6377(01)00102-X
Publication status	Published - 2001

Access to Document

10.1016/S0167-6377(01)00102-X

Cite this

@article{85b24809c8be4c6ba71e8ce50a59c609,

title = "Hardness of approximation of the discrete time-cost tradeoff problem",

abstract = "We consider the discrete version of the well-known time-cost tradeoff problem for project networks, which has been extensively studied in the project management literature. We prove a strong in-approximability result with respect to polynomial time bicriteria approximation algorithms for this problem.",

author = "V.G. Deineko and G.J. Woeginger",

year = "2001",

doi = "10.1016/S0167-6377(01)00102-X",

language = "English",

volume = "29",

pages = "207--210",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier B.V.",

number = "5",

}

TY - JOUR

T1 - Hardness of approximation of the discrete time-cost tradeoff problem

AU - Deineko, V.G.

AU - Woeginger, G.J.

PY - 2001

Y1 - 2001

N2 - We consider the discrete version of the well-known time-cost tradeoff problem for project networks, which has been extensively studied in the project management literature. We prove a strong in-approximability result with respect to polynomial time bicriteria approximation algorithms for this problem.

AB - We consider the discrete version of the well-known time-cost tradeoff problem for project networks, which has been extensively studied in the project management literature. We prove a strong in-approximability result with respect to polynomial time bicriteria approximation algorithms for this problem.

U2 - 10.1016/S0167-6377(01)00102-X

DO - 10.1016/S0167-6377(01)00102-X

M3 - Article

SN - 0167-6377

VL - 29

SP - 207

EP - 210

JO - Operations Research Letters

JF - Operations Research Letters

IS - 5

ER -

Hardness of approximation of the discrete time-cost tradeoff problem

Abstract

Access to Document

Fingerprint

Cite this