Servicios Personalizados
Revista
Articulo
Indicadores
- Citado por SciELO
- Accesos
Links relacionados
- Citado por Google
- Similares en SciELO
- Similares en Google
Compartir
Ingeniería y Ciencia
versión impresa ISSN 1794-9165
Resumen
MORILLO, Daniel; MORENO, Luis y DIAZ, Javier. Analytic and Heuristic Methodologies for Solving the Resource Constrained Project Scheduling Problem (RCPSP): a review Part 1. ing.cienc. [online]. 2014, vol.10, n.19, pp.247-271. ISSN 1794-9165.
This paper presents and describes the most relevant methods for the solution of the Resource Constrained Project Scheduling Problem, RCPSP. A critical review of the state of the art, based on the most signicant papers published in the academic literature on this topic is carried out. First, several exact methods of solution are shown and their main advantages and disadvantages are explained; the Branch and Bound methods, considered as the best exact algorithms for solving this problem, are described. Subsequently, several heuristic methods, especially those that have been implemented for sequencing problems, are considered.
Palabras clave : task scheduling; constrained resources; heuristic methods; exact methods.