| Nome: | Descrição: | Tamanho: | Formato: | |
|---|---|---|---|---|
| 1002.66 KB | Adobe PDF |
Orientador(es)
Resumo(s)
This paper presents a biased random-key genetic algorithm for the resource constrained project scheduling problem. The chromosome representation of the problem is based on random keys. Active schedules are constructed using a priority-rule heuristic in which the priorities of the activities are defined by the genetic algorithm. A forward-backward improvement procedure is applied to all solutions. The chromosomes supplied by the genetic algorithm are adjusted to reflect the solutions obtained by the improvement procedure. The heuristic is 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
Contexto Educativo
Citação
Editora
Springer