A memetic algorithm for the resource-constrained project scheduling problem

This study presents a memetic algorithm for the resource-constrained project scheduling problem (RCPSP) with makespan minimization as objective.We propose a new memetic algorithm approach to solve this problem and a serial scheme is utilized [0 provide a scheduJe according to the precedence and resource constraints to be evaluated.Then the framework of the me me tic algorithm for the RCPSP is developed.The procedures are as follows.First, ACO searches the solution space and generates activity lists to provide the initial population for memtic.Nexl, memetic is executed and improves the initial solution.analyses are provided to investigate the performance of the memetic approach for the RCPSP.Tbe study aims at developing an alternative and efficient optimization methodology for solving the RCPSP and opening tbe application of memetic to this problem.The experimental results of this metaheuristic on the standard sets of the project instances show that this is an effective metbod for solving the RCPSP.