Solving Multi mode Resource Constrained Project Scheduling with ICO algorithm and Compare it with PSO algorithm

Well-timed execution of project activities requires an integrated and effective planning and management in an accurate adjustment of the project activities execution time. Although a lot of works has been done on MRCPSP (multi-resource constrained project scheduling problem) with the goal of minimizing the project makespan, but considering other goals in current projects like the project total cost is also important to the managers. So in this article, a mathematical model has been considered for resource-constrained project scheduling with two objectives: minimizing both project total cost and makespan. And this problem has been solved with a meta-heuristic algorithm called Imperialist Competitive algorithm which has never been used to solve this type of problems. The results have been compared with PSO algorithm in which they are satisfactory.