A mixed (continuous plus discrete) time-cost trade-off model considering four different relationships with lag time
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Son, Jaeho | - |
dc.contributor.author | Hong, TaeHoon | - |
dc.contributor.author | Lee, Sangyoub | - |
dc.date.accessioned | 2021-11-11T04:42:10Z | - |
dc.date.available | 2021-11-11T04:42:10Z | - |
dc.date.created | 2021-11-10 | - |
dc.date.issued | 2013-03 | - |
dc.identifier.issn | 1226-7988 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/17173 | - |
dc.description.abstract | Numerous Time-Cost Trade-Off (TCTO) models have been developed to identify the best combination of time and cost in a critical path network. Although there are four relationships in the critical path network, most of the models developed so far have considered only the Finish-Start (F-S) relationship. Thus, an advanced TCTO model that considers all four relationships between activities was developed in this study to accurately present a project, and is presented in this paper. The model also takes into account the lag time between activities. Previous TCTO models minimize the total project cost based on the given crash scenario. Moreover, to enhance the practicality, the model was developed to work with various TCTO scenarios such as continuous, discrete, and even mixed (continuous + discrete). The combined scenario reflects the most realistic situation. Two independent scenarios cannot be combined without mathematical modifications since a rudimentary mixing of two scenarios may provide an incorrect solution. A new formulation technique is introduced to merge the two independent scenarios mathematically and it guarantees the optimal solution. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | KOREAN SOCIETY OF CIVIL ENGINEERS-KSCE | - |
dc.subject | GENETIC ALGORITHM | - |
dc.subject | OPTIMIZATION | - |
dc.subject | GA | - |
dc.title | A mixed (continuous plus discrete) time-cost trade-off model considering four different relationships with lag time | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Son, Jaeho | - |
dc.identifier.doi | 10.1007/s12205-013-1506-3 | - |
dc.identifier.scopusid | 2-s2.0-84875485676 | - |
dc.identifier.wosid | 000316819400004 | - |
dc.identifier.bibliographicCitation | KSCE JOURNAL OF CIVIL ENGINEERING, v.17, no.2, pp.281 - 291 | - |
dc.relation.isPartOf | KSCE JOURNAL OF CIVIL ENGINEERING | - |
dc.citation.title | KSCE JOURNAL OF CIVIL ENGINEERING | - |
dc.citation.volume | 17 | - |
dc.citation.number | 2 | - |
dc.citation.startPage | 281 | - |
dc.citation.endPage | 291 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.identifier.kciid | ART001747523 | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.description.journalRegisteredClass | kci | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalWebOfScienceCategory | Engineering, Civil | - |
dc.subject.keywordPlus | GENETIC ALGORITHM | - |
dc.subject.keywordPlus | OPTIMIZATION | - |
dc.subject.keywordPlus | GA | - |
dc.subject.keywordAuthor | Time-Cost Trade-Off | - |
dc.subject.keywordAuthor | critical path method | - |
dc.subject.keywordAuthor | optimization models | - |
dc.subject.keywordAuthor | linear programming | - |
dc.subject.keywordAuthor | integer programming | - |
dc.subject.keywordAuthor | costs | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
94, Wausan-ro, Mapo-gu, Seoul, 04066, Korea02-320-1314
COPYRIGHT 2020 HONGIK UNIVERSITY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.