A genetic algorithm for the resource constrained multi-project scheduling problem

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

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

Use this identifier to reference this record.

Name:	Description:	Size:	Format:
ART_JGoncalves_2008_CIDEM.pdf		393.35 KB	Adobe PDF	Download

Send Feedback

Authors

Gonçalves, J. F.

Mendes, J. J. M.

Resende, M. G. C.

Abstract(s)

This paper presents a genetic algorithm for the resource constrained multi-project scheduling problem. The chromosome representation of the problem is based on random keys. The schedules are constructed using a heuristic that builds parameterized active schedules based on priorities, delay times, and release dates defined by the genetic algorithm. The approach is tested on a set of randomly generated problems. The computational results validate the effectiveness of the proposed algorithm.