Analytic and Heuristic Methodologies for Solving the Resource Constrained Project Scheduling Problem (RCPSP): a review Part 1

摘要

This paper presents and describes the most relevant methods for the solutionof the Resource Constrained Project Scheduling Problem, RCPSP. Acritical review of the state of the art, based on the most signicant paperspublished in the academic literature on this topic is carried out. First,several exact methods of solution are shown and their main advantagesand disadvantages are explained; the Branch and Bound methods, consideredas the best exact algorithms for solving this problem, are described.Subsequently, several heuristic methods, especially those that have beenimplemented for sequencing problems, are considered.MSC: 90B35