Genetic Algorithm for Resource Constrained Project Scheduling

Resource Constrained Project Scheduling (RCPS) can be defined as the project scheduling with limited availability of resources to achieve goals such as minimization of makespan and maximization of Net Present Value (NPV). In this paper we have used Genetic algorithm (GA) to solve RCPS problem to minimize the makespan. By modifying the classical approach using GA, we solved the standard scheduling problems available and compared the results to previous researchers result and it shows that algorithm gives the optimal schedules and can be used for variable conditions of the resource usage in the problem.