摘要
The multi-mode resource constrained project scheduling problem (MRCPSP) is an NP-hard optimisation problem involving scheduling tasks under resource and precedence constraints, while there are several modes for executing each task. In this paper, we propose a novel matheuristic based on relax-and-solve (R &S) algorithm to solve MRCPSP. In addition, a mathematical programming model, which is the generalisation of the multi-dimensional knapsack problem is developed. That model conducts the mode selection process for the purpose of generating an initial feasible solution. We evaluate the performance of the proposed algorithm by solving benchmark instances that are widely used in the literature. The results demonstrate that the proposed R &S algorithm outperforms the state-of-the-art methods for solving the MRCPSP.
学科与关键词
- Multi-mode resource-constrained project scheduling using RCPSP and SAT solversCoelho, Jose; Vanhoucke, Mario*EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2011, 213(1): 73-82.被引 87
- 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
- A memetic algorithm to address the multi-node resource-constrained project scheduling problemMachado-Dominguez, Luis F.*; Paternina-Arboleda, Carlos D.; Velez, Jorge, I; Barrios-Sarmiento, AgustinJOURNAL OF SCHEDULING, 2021, 24(4): 413-429.被引 6
