A random key based genetic algorithm for the resource constrained project scheduling problem

J. J. M. Mendes, J. F. Gonçalves, and M. G. C. Resende

Computers and Operational Research, vol. 36, pp. 92-109, 2009.


This paper presents a genetic algorithm for the Resource Constrained Project Scheduling Problem (RCPSP). The chromosome representation of the problem is based on random keys. The schedule is constructed using a heuristic priority rule in which the priorities of the activities are defined by the genetic algorithm. The heuristic generates parameterized active schedules. The approach was tested on a set of standard problems taken from the literature and compared with other approaches. The computation results validate the effectiveness of the proposed algorithm.

PDF file of full paper

Go back

Mauricio G.C. Resende's Home Page

Last modified: 28 January 2009

Copyright Notice