In this paper a new deterministic mathematical model for time-cost trade-off is introduced. The proposed method is based on path constraints in a network while other similar methods are modelled based on activities. Through this paper, the proposed model is constructed and thenvalidated by testing in a case study. The achieved results from model are compared with manual solution. The results of both proposed model and manual solution are exactly same which proves the accuracy of the model. Moreover, using network paths for constructing the constraints has the benefit of a lower number of constraints and leading to a faster and more straightforward solution. Lower number of constraints might lead to less computing effort. This can provide us an opportunity to solve some networks which are NP-hard by other similar approaches. Finally can summarize that the main advantages of the proposed model are simplicity in modelling and the usage of a fewer equations.
展开▼
