Solving the RCPSP with an evolutionary algorithm based on instance information
The Resource Constrained Project Scheduling Problem (RCPSP) is NP-hard thus justifying the use meta-heuristics for its solution. This paper presents an evolutionary algorithm developed for the RCPSP problem. This evolutionary algorithm uses an alphabet based on random keys that makes easier its impl...
Autor principal: | |
---|---|
Outros Autores: | , |
Formato: | conferencePaper |
Idioma: | eng |
Publicado em: |
2012
|
Assuntos: | |
Texto completo: | http://hdl.handle.net/1822/35282 |
País: | Portugal |
Oai: | oai:repositorium.sdum.uminho.pt:1822/35282 |