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

Etminaniesfahani, A; Gu, H; Naeni, LM; Salehipour, A

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

Etminaniesfahani, A Gu, H

Naeni, LM Salehipour, A

Permalink

Publisher:: SPRINGER
Publication Type:: Journal Article
Citation:: Annals of Operations Research, 2024
Issue Date:: 2024-01-01

Closed Access

	Filename	Description	Size
	ICORES_2024_31_CR.pdf	Accepted version	414.41 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Etminaniesfahani, A
dc.contributor.author	Gu, H https://orcid.org/0000-0003-2035-2583
dc.contributor.author	Naeni, LM
dc.contributor.author	Salehipour, A
dc.date.accessioned	2024-04-17T01:02:37Z
dc.date.available	2024-04-17T01:02:37Z
dc.date.issued	2024-01-01
dc.identifier.citation	Annals of Operations Research, 2024
dc.identifier.issn	0254-5330
dc.identifier.issn	1572-9338
dc.identifier.uri	http://hdl.handle.net/10453/177992
dc.description.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.
dc.language	English
dc.publisher	SPRINGER
dc.relation.ispartof	Annals of Operations Research
dc.relation.isbasedon	10.1007/s10479-023-05775-8
dc.rights	info:eu-repo/semantics/closedAccess
dc.subject	01 Mathematical Sciences, 08 Information and Computing Sciences, 15 Commerce, Management, Tourism and Services
dc.subject.classification	Operations Research
dc.subject.classification	35 Commerce, management, tourism and services
dc.subject.classification	46 Information and computing sciences
dc.subject.classification	49 Mathematical sciences
dc.title	An efficient relax-and-solve method for the multi-mode resource constrained project scheduling problem
dc.type	Journal Article
utslib.for	01 Mathematical Sciences
utslib.for	08 Information and Computing Sciences
utslib.for	15 Commerce, Management, Tourism and Services
pubs.organisational-group	University of Technology Sydney
pubs.organisational-group	University of Technology Sydney/Faculty of Design, Architecture and Building
pubs.organisational-group	University of Technology Sydney/Faculty of Design, Architecture and Building/School of Built Environment
pubs.organisational-group	University of Technology Sydney/Faculty of Science
pubs.organisational-group	University of Technology Sydney/Faculty of Science/School of Mathematical and Physical Sciences
utslib.copyright.status	closed_access	*
pubs.consider-herdc	false
dc.date.updated	2024-04-17T01:02:35Z
pubs.publication-status	Published

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.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/177992