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