A Novel Modified Ant Colony Optimization for Solving Multi-Skill Resource-Constrained Project Scheduling Problem

multi-skills resource-constrained project scheduling problem (MS-RCPSP) is assigned to employees under the predecessor tasks constraint and the multi-skills constraint in order to create the feasible schedule with both the cheapest cost and the shortest completion duration. MS-RCPSP has multi-goals and complexity so Ant Colony Optimization (ACO) is applied to solve MS-RCPSP. Many researchers can find either the cheapest cost plan or the shortest completion duration plan. However, the practical applications want them both together. Hence, this paper proposes modifying ACO solving MS-RCPSP and obtaining good results both the cheapest cost and the shortest completion duration. The proposed algorithm was tested on thirty-six test cases from an MS-RCPSP iMOPSE datasets and provided more satisfactory results in comparison with other ACO algorithms.