Optimal selection of recourses in projects based on the classical time - cost trade - offs

Abstract

Network models are often applied in project scheduling. In Time-cost Trade-offs problem time and cost parameters are assigned to the activities. It means that we have to decide the technology (recourses) will be applied. Generally there is not only one proper variant in construction practice. In this paper I generate the Time-cost Trade-offs problem based on maximal flow algorithm by integration the possibility of changing technology. In this way the algorithm will automatically select the proper technological variant for the activities.