using MOPSO methd for solving resource constrained project scheduling with make-epsan, NPV and robustness criteria

Project-based management is becoming more and more important as a tool for improving the performance of organizations the problem of scheduling activites with precedence consdtraints (e.g.CPM/PERT methods) has been studied for a long time. More recently , with the increasing importance of resource constraints, the need for explicitly considering these constraints has also become evident. it is in this context that the resource contranied project scheduling problem(RCPSP) arises. although PCPSP is essentially a multi- objective issue, but generally it has been noticed as a single objective problem. in this paper, a multi- objective model of RCPSP is presented. we aim at obtaining good approximations of the set of non -dominated solutions of a problem, in an efficiednt way. weh have applied multi-objevtive version of PSO to the resource constrained project scheduling problem, in order to minimize the make - span, maximize NPV and robustness.