A random key based genetic algorithm for the resource constrained project scheduling problem
| Data(s) |
06/06/2014
06/06/2014
2009
|
|---|---|
| Resumo |
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. |
| Identificador | |
| Idioma(s) |
eng |
| Publicador |
Elsevier |
| Relação |
Computers & Operations Research; Vol. 36, Issue 1 http://www.sciencedirect.com/science/article/pii/S0305054807001359 |
| Direitos |
openAccess |
| Palavras-Chave | #Project management #Scheduling #Genetic algorithms #Random keys #RCPSP |
| Tipo |
article |