Memetic algorithm to minimize costs of activities in rcpsp
The Resource-Constrained Project Scheduling Problem (RCPSP) is a classic and important problem in project management and has got much attention from researchers. In this paper, we consider the case in which the cost of activities has to be minimized. This variant of the problem can be found mainly i...
| Autores: | , , |
|---|---|
| Tipo de documento: | artigo |
| Estado: | Versão publicada |
| Data de publicação: | 2012 |
| País: | Colombia |
| Recursos: | Universidad Nacional de Colombia |
| Repositório: | Repositorio UN |
| Idioma: | espanhol |
| OAI Identifier: | oai:repositorio.unal.edu.co:unal/38641 |
| Acesso em linha: | https://repositorio.unal.edu.co/handle/unal/38641 http://bdigital.unal.edu.co/28738/ |
| Access Level: | Acceso aberto |
| Palavra-chave: | Project scheduling activity cost memetic algorithm. |
| Resumo: | The Resource-Constrained Project Scheduling Problem (RCPSP) is a classic and important problem in project management and has got much attention from researchers. In this paper, we consider the case in which the cost of activities has to be minimized. This variant of the problem can be found mainly in construction management supply chains. Its characteristics show that this objective function is non-regular and that the problem is NP-hard. This paper presents a memetic algorithm to solve this problem. Computational experiments are carried out using well-known instances from the PSPLIB. Results obtained validate the effectiveness of the proposed algorithm and allow us to understand the algorithm’s behavior |
|---|