Solving resource-constrained project scheduling problem by genetic algorithm

This paper proposes a genetic algorithm to solve resource constrained project scheduling problem, in which resources are optimally allocated to tasks. Resources are renewable. In RCPSP each activity is executing in single mode. This work employed genetic algorithm to schedule project task to minimize makespan respect to resource constraint and precedence constraint. The Schedule Generation Scheme was used to decode project plan. The approach was tested on a set of standard problem obtained from Project Scheduling Problem Library (PSLIB) and algorithm given in this paper was compared with the existing optimization algorithm, the result reveals that the algorithm is effective for the RCPSP.