The Library
Hardness of approximation of the discrete time-cost tradeoff problem
Tools
UNSPECIFIED (2001) Hardness of approximation of the discrete time-cost tradeoff problem. OPERATIONS RESEARCH LETTERS, 29 (5). pp. 207-210. ISSN 0167-6377.
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
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. (C) 2002 Elsevier Science B.V. All rights reserved.
Item Type: | Journal Article | ||||
---|---|---|---|---|---|
Subjects: | H Social Sciences > HD Industries. Land use. Labor > HD28 Management. Industrial Management | ||||
Journal or Publication Title: | OPERATIONS RESEARCH LETTERS | ||||
Publisher: | ELSEVIER SCIENCE BV | ||||
ISSN: | 0167-6377 | ||||
Official Date: | December 2001 | ||||
Dates: |
|
||||
Volume: | 29 | ||||
Number: | 5 | ||||
Number of Pages: | 4 | ||||
Page Range: | pp. 207-210 | ||||
Publication Status: | Published |
Data sourced from Thomson Reuters' Web of Knowledge
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |