Complexity of the discrete time-cost tradeoff problem for project networks

Simple item page
dc.citation.epage306en_US
dc.citation.issueNumber2en_US
dc.citation.spage302en_US
dc.citation.volumeNumber45en_US
dc.contributor.authorDe, P.en_US
dc.contributor.authorDunne, E. J.en_US
dc.contributor.authorGhosh, J. B.en_US
dc.contributor.authorWells, C. E.en_US
dc.date.accessioned2019-02-06T16:27:36Z
dc.date.available2019-02-06T16:27:36Z
dc.date.issued1997en_US
dc.departmentDepartment of Managementen_US
dc.description.abstractThis note addresses the discrete version of the well-known time-cost tradeoff problem for project networks, which has been studied previously in the standard project management literature as well as in the related literature on Decision-CPM. All the algorithms proposed thus far for the solution of the general problem exhibit exponential worst-case complexity, with the notable exception of the pseudo-polynomial dynamic program due to Hindelang and Muth. We first demonstrate that this algorithm is flawed, and that when we correct it, it no longer remains pseudo-polynomial. Continuing on in the main result of the note, we show that this is not at all surprising, since the problem is strongly NP-hard. Finally, we discuss the complexities of various network structures and validate an old conjecture that certain structures are necessarily more difficult to solve.en_US
dc.description.provenanceSubmitted by Merve Nalbant (merve.nalbant@bilkent.edu.tr) on 2019-02-06T16:27:36Z No. of bitstreams: 1 Complexity_of_the_Discrete_Time_Cost_Tradeoff_Problem_for_Project_Networks.pdf: 479463 bytes, checksum: 8acc3375d458e789e6dda8a5a2f8697b (MD5)en
dc.description.provenanceMade available in DSpace on 2019-02-06T16:27:36Z (GMT). No. of bitstreams: 1 Complexity_of_the_Discrete_Time_Cost_Tradeoff_Problem_for_Project_Networks.pdf: 479463 bytes, checksum: 8acc3375d458e789e6dda8a5a2f8697b (MD5) Previous issue date: 1997en
dc.identifier.doi10.1287/opre.45.2.302en_US
dc.identifier.eissn1526-5463
dc.identifier.issn0030-364X
dc.identifier.urihttp://hdl.handle.net/11693/48970
dc.language.isoEnglishen_US
dc.publisherInstitute for Operations Research and the Management Sciences (INFORMS)en_US
dc.relation.isversionofhttps://doi.org/10.1287/opre.45.2.302en_US
dc.source.titleOperations Researchen_US
dc.subjectProject managementen_US
dc.subjectTime-cost tradeoffen_US
dc.subjectAnalysis of algorithmsen_US
dc.subjectComputational complexityen_US
dc.titleComplexity of the discrete time-cost tradeoff problem for project networksen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Complexity_of_the_Discrete_Time_Cost_Tradeoff_Problem_for_Project_Networks.pdf
Size:
468.23 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Scholarly Publications - Management