Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
474837 | Computers & Operations Research | 2009 | 18 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
J.J.M. Mendes, J.F. Gonçalves, M.G.C. Resende,