Hardness of approximation of the discrete time-cost tradeoff problem

被引：27

作者：

Deineko, VG

Woeginger, GJ

机构：

[1] Univ Twente, Dept Math, NL-7500 AE Enschede, Netherlands

[2] Univ Warwick, Warwick Business Sch, Coventry CV4 7AL, W Midlands, England

[3] Graz Tech Univ, Inst Math, A-8010 Graz, Austria

来源：

OPERATIONS RESEARCH LETTERS | 2001年 / 29卷 / 05期

关键词：

project management; decision CPM networks; bicriteria optimization; precedence constraints; approximation algorithm;

D O I：

10.1016/S0167-6377(01)00102-X

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

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. (C) 2002 Elsevier Science B.V. All rights reserved.

引用

页码：207 / 210

页数：4

共 6 条

[1] Some APX-completeness results for cubic graphs [J].