A genetic algorithm for solving a resource-constrained project scheduling problem

In this paper, we develop a modified genetic algorithm for solving the resource-constrained project scheduling problem (RCPSP). The coding scheme and decoding rule, fitness function, genetic operators and the way of generating initial population are described. We made a thorough computational study for a standard set of project instances which has been widely used, and analyzed the impact of the parameters of algorithm and problem on the performance of the algorithm, the results reveal that the genetic algorithm is effective for the RCPSP.