Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
482027 | European Journal of Operational Research | 2008 | 20 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
J.F. Gonçalves, J.J.M. Mendes, M.G.C. Resende,