摘要
The multi-mode resource-constrained project scheduling problem (MRCPSP) is a very general scheduling model. The MRCPSP covers problems where activities can be executed in several ways or modes, and is affected by parameters such as their duration, temporary relationships with other activities, and renewable and non-renewable resource requirements. The objective of the MRCPSP is to select a combination of time/resources to minimize the duration of the project and complete all activities while satisfying all resource constraints and precedence relationships. Here, we describe a memetic algorithm to solve the MRCPSP. This algorithm uses the components of genetic algorithms and variable neighborhoods search to implement (1) an adaptation of the uniform crossover operator, and (2) a local search to assess agents' performance that appropriately guides the evolution of the algorithm and hence generate better solutions. We implement a metaheuristic strategy and compare its performance for solving different instances of the standard PSPLIB and MMLIB libraries. Overall, our memetic algorithm provides suitable solutions for the MRCPSP and shows outstanding performance in all tested instances.
学科与关键词
- Memetic algorithm for solving resource constrained project scheduling problemsRahman, Humyun Fuad*; Chakrabortty, Ripon K.; Ryan, Michael J.AUTOMATION IN CONSTRUCTION, 2020, 111: 103052.被引 65
- Solving a real-life multi-skill resource-constrained multi-project scheduling problemTorba, Rahman*; Dauzere-Peres, Stephane; Yugma, Claude; Gallais, Cedric; Pouzet, JulietteAnnals of Operations Research, 2024, 338(1): 69-114.被引 4
- A matheuristic approach to the multi-mode resource constrained project scheduling problemFernandes, Gustavo Alves; de Souza, Sergio Ricardo*COMPUTERS & INDUSTRIAL ENGINEERING, 2021, 162: 107592.被引 10
