This paper presents a genetic algorithm for the multimode
resource-constrained project scheduling problem (MRCPSP),
in which multiple execution modes are available for each of the
activities of the project. The objective function is the minimization of
the construction project completion time. To solve the problem, is
applied a two-level genetic algorithm, which makes use of two
separate levels and extend the parameterized schedule generation
scheme by introducing an improvement procedure. It is evaluated the
quality of the schedule and present detailed comparative
computational results for the MRCPSP, which reveal that this
approach is a competitive algorithm
