SciELO - Scientific Electronic Library Online

 
vol.23 issue2Step by step search for achievable intermediate targets in zero sum gains DEA modelA Genetic Based Approach to the Vehicle Routing Problem author indexsubject indexarticles search
Home Pagealphabetic serial listing  

Services on Demand

Journal

Article

Indicators

Related links

  • Have no similar articlesSimilars in SciELO

Share


Investigação Operacional

Print version ISSN 0874-5161

Abstract

MENDES, Jorge José de Magalhães  and  GONCALVES, José Fernando. A Genetic Algorithm for the Resource Constrained Project Scheduling Problem. Inv. Op. [online]. 2003, vol.23, n.2, pp.179-195. ISSN 0874-5161.

This paper presents a genetic algorithm for the Resource Constrained Project Scheduling Problem (RCPSP). The chromosome representation of the problem is based on random keys. The schedule is constructed using a heuristic priority rule in which the priorities activities are defined by the genetic algorithm. The heuristic generates parameterized active schedules. The approach is tested on a set of standard problems taken from the literature and compared with other approaches. The computation results validate the effectiveness of the proposed algorithm.

Keywords : Project Management; Scheduling; Genetic Algorithms; RCPSP; Random Keys.

        · abstract in Portuguese     · text in Portuguese     · Portuguese ( pdf )