An efficient relax-and-solve method for the multi-mode resource constrained project scheduling problem

Alireza Etminaniesfahani (), Hanyu Gu (), Leila Moslemi Naeni () and Amir Salehipour ()
Additional contact information
Alireza Etminaniesfahani: University of Technology Sydney
Hanyu Gu: University of Technology Sydney
Leila Moslemi Naeni: University of Technology Sydney
Amir Salehipour: The University of Sydney Business School

Annals of Operations Research, 2024, vol. 338, issue 1, No 3, 68 pages

Abstract: Abstract 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.

Keywords: Relax-and-solve; Multi-mode resource constrained project scheduling problem; Matheuristic; Rolling time window; Constraint programming (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10479-023-05775-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:338:y:2024:i:1:d:10.1007_s10479-023-05775-8

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-023-05775-8

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().