Resumo

MORENO, LUIS FERNANDO; DIAZ, FRANCISCO JAVIER; PENA, GLORIA ELENA  e  RIVERA, JUAN CARLOS. A COMPARATIVE ANALYSIS BETWEEN TWO HEURISTIC ALGORITHMS FOR SOLVING THE RESOURCE- CONSTRAINED PROJECT SCHEDULING PROBLEM (RCPSP). Dyna rev.fac.nac.minas [online]. 2007, vol.74, n.151, pp.171-183. ISSN 0012-7353.

The Resource-Constrained Project Scheduling Problem, RCPSP, has been studied by means of analytical techniques that guarantee an optimal solution, although actually are nonviable due to the high processing time. For that reason, heuristic algorithms are used, that, although do not guarantee an optimal solution, can give satisfactory results in considerably less time. The heuristic algorithms more used to solve the RCPSP are Simulated Annealing, Taboo Search, Genetic Algorithms and Grasp, since by its flexibility they allow variations in the specific form of application. In the present paper two variations are introduced to improve the efficiency of the algorithms Taboo Search and Simulated Annealing, which are the use of the lower bound known as LBS and the denominated strategy of minimal durations proposed by the authors.

Palavras-chave : Task programming; Heuristic; Taboo search; Simulated annealing; RCPSP; Minimal durations; Lower bound.

        · resumo em Espanhol     · texto em Espanhol     · Espanhol ( pdf )