A two-level genetic algorithm for the multi-mode resource-constrained project scheduling problem

摘要

This paper presents a genetic algorithm for the multimoderesource-constrained project scheduling problem (MRCPSP),in which multiple execution modes are available for each of theactivities of the project. The objective function is the minimization ofthe construction project completion time. To solve the problem, isapplied a two-level genetic algorithm, which makes use of twoseparate levels and extend the parameterized schedule generationscheme by introducing an improvement procedure. It is evaluated thequality of the schedule and present detailed comparativecomputational results for the MRCPSP, which reveal that thisapproach is a competitive algorithm.