A mixed (continuous plus discrete) time-cost trade-off model considering four different relationships with lag time
- Authors
- Son, Jaeho; Hong, TaeHoon; Lee, Sangyoub
- Issue Date
- Mar-2013
- Publisher
- KOREAN SOCIETY OF CIVIL ENGINEERS-KSCE
- Keywords
- Time-Cost Trade-Off; critical path method; optimization models; linear programming; integer programming; costs
- Citation
- KSCE JOURNAL OF CIVIL ENGINEERING, v.17, no.2, pp.281 - 291
- Journal Title
- KSCE JOURNAL OF CIVIL ENGINEERING
- Volume
- 17
- Number
- 2
- Start Page
- 281
- End Page
- 291
- URI
- https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/17173
- DOI
- 10.1007/s12205-013-1506-3
- ISSN
- 1226-7988
- 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.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Science and Technology > Major in Architecture Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.