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

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

http://hdl.handle.net/10400.22/4520

Use this identifier to reference this record.

Name:	Description:	Size:	Format:
ART_JMendes_2009_CIDEM.pdf		853.57 KB	Adobe PDF	Download

Send Feedback

Authors

Mendes, J. J. M.

Gonçalves, J. F.

Resende, M. G. C.

Abstract(s)

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 computational results validate the effectiveness of the proposed algorithm.