A multi-objective resource-constrained optimization of time-cost trade-off problems in scheduling project

This paper presents a multi-objective resource-constrained project scheduling problem with positive and negative cash flows. The net present value (NPV) maximization and making span minimization are this study objectives. And since this problem is considered as complex optimization in NP-Hard context، we present a mathematical model for the given problem and solve three evolutionary algorithms; NSGA-II، MOSA and MOPSO are applied to find the set of Pareto solutions for this multi-objective scheduling problem. In order to show performance of the algorithms، different metrics are applied and comparisons between the two algorithms are also considered. The computational results for a set of test problems taken from the project scheduling problem Bandar Abbas Gas condensate Refinery project and library are presented and discussed. Finally، the computational results illustrate the superior performance of the NSGA-II، MOSA and MOPSO algorithm with regard to the proposed metrics. In order to solve proposed method from NSGA-II algorithm، the results are compared with GAMS software in some problems. The proposed method is a Converge to the optimum and efficient solution algorithm.