In this article, a novel Permutation-based Bees Algorithm (PBA) is proposed for the resource-constrained project scheduling problem (RCPSP) which is widely applied in advanced manufacturing, production planning, and project management. The PBA is a modification of existing Bees Algorithm (BA) adapted for solving combinatorial optimization problems by changing some of the algorithm's core concepts. The algorithm treats the solutions of RCPSP as bee swarms and employs the activity-list representation and moves operators for the bees, in association with the serial scheduling generation scheme (Serial SGS), to execute the intelligent updating process of the swarms to search for better solutions. The performance of the proposed approach is analysed across various problem complexities associated with J30, J60 and J120 full instance sets of PSPLIB and compared with other approaches from the literature. Simulation results demonstrate that the proposed PBA provides an effective and efficient approach for solving RCPSP.
The Proactive and Reactive Resource-Constrained Project Scheduling Problem: The Crucial Role of Buffer-Based Reactions
