%0 Journal Article %T Project Scheduling with Simultaneous Optimization, Time, Net Present Value, and Project Flexibility for Multimode Activities with Constrained Renewable Resources %J International Journal of Engineering %I Materials and Energy Research Center %Z 1025-2495 %A Farughi, H %A Amiri, A %A Abdi, F %D 2018 %\ 05/01/2018 %V 31 %N 5 %P 780-791 %! Project Scheduling with Simultaneous Optimization, Time, Net Present Value, and Project Flexibility for Multimode Activities with Constrained Renewable Resources %K Resource constrained project scheduling %K time %K cost trade %K Off %K Simulated Annealing meta %K Heuristic Algorithm %K Project flexibility %K multi %K mode activities %R %X Project success is assessed based on various criteria, every one of which enjoys a different level of importance for the beneficiaries and decision makers. Time and cost are the most important objectives and criteria for the project success. On the other hand, reducing the risk of finishing activities until the predetermined deadlines should be taken into account. Having formulated the problem as a multi-objective planning problem, the present study aims at minimizing the project completion time as well as maximizing the net present value and project flexibility by taking into account the resource constraints and precedence relations. Here the flexibility of project is calculated by considering a free float for each activity and maximizing the sum of these flotation times. Although most of the researches considered the resources as non-renewable resources, here the resources are considered as renewable ones. Moreover, performing each activity may be possible in various states of using resources (mode) which can change the project completion time and cost. Owing to the complexity of the problem, the Multi Objective Simulated Annealing Meta-heuristic Algorithm is used to solve the proposed model. In doing so, first a feasible answers is proposed and then, using the aforementioned algorithm, it was attempted to find Pareto answers. For accrediting the algorithm, four benchmark problems have been considered. Since the algorithm performed well in finding the optimal answers to the benchmark problems, it was used to find the optimal answer of large scale problems. %U https://www.ije.ir/article_73180_a246f554dc6c784ac5e70917a7d65556.pdf