| Nome: | Descrição: | Tamanho: | Formato: | |
|---|---|---|---|---|
| 853.57 KB | Adobe PDF |
Orientador(es)
Resumo(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.
Descrição
Palavras-chave
Project management Scheduling Genetic algorithms Random keys RCPSP
Contexto Educativo
Citação
Editora
Elsevier