In this paper, a mathematical model is presented for project scheduling with multiple purposes based on considering cost payment and resource constrains and since this this problem is considered as complex optimization in NP-Hard context, in order to solve proposed method from NSGA-II algorithm and the results are compared with GAMS software in some problems. The proposed method is a Converge to the optimum and efficient solution algorithm. Besides this algorithm is used in some parts of refinery project.
کلید واژگان :
Project-scheduling problems, maximize the NPV, the Payments pattern, Time-cost tradeoff, NSGA-II algorithm, GAMS software
