An Efficient Relax-and-Solve Algorithm for the Resource-Constrained Project Scheduling Problem

Etminaniesfahani, A; Gu, H; Salehipour, A

An Efficient Relax-and-Solve Algorithm for the Resource-Constrained Project Scheduling Problem

Etminaniesfahani, A Gu, H

Salehipour, A

Permalink

Publisher:: SCITEPRESS - Science and Technology Publications
Publication Type:: Conference Proceeding
Citation:: Proceedings of the 11th International Conference on Operations Research and Enterprise Systems, 2022, pp. 271-271
Issue Date:: 2022

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download Accepted versionAdobe PDF (203.89 kB)

View on publisher's site

View statistics

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	Salehipour, A
dc.contributor.editor	Liberatore, F
dc.contributor.editor	Parlier, GH
dc.contributor.editor	Demange, M
dc.date	2022-02-03
dc.date.accessioned	2023-02-15T10:46:02Z
dc.date.available	2023-02-15T10:46:02Z
dc.date.issued	2022
dc.identifier.citation	Proceedings of the 11th International Conference on Operations Research and Enterprise Systems, 2022, pp. 271-271
dc.identifier.isbn	978-989-758-548-7
dc.identifier.uri	http://hdl.handle.net/10453/166165
dc.description.abstract	The resource-constrained project scheduling problem (RCPSP) has a broad range of practical applications, e.g., in manufacturing, mining, and supply chain, among others(Kreter et al., 2015). Over the last 50 years, many researchers have tried to solve this challenging NP-hard problem. This paper presents an efficient and easy-to-implement relax-and-solve matheuristic to solve RCPSP. The proposed method employs constraint programming in a heuristic framework and uses CPLEX as an optimization solver. This algorithm is tested on more than 1500 instances from the standard library PSPLIB. Our experimental results show that the proposed heuristic framework outperforms the CPLEX and provides competitive results compared with the state-of-the-art techniques.
dc.language	en
dc.publisher	SCITEPRESS - Science and Technology Publications
dc.relation.ispartof	Proceedings of the 11th International Conference on Operations Research and Enterprise Systems
dc.relation.ispartof	11th International Conference on Operations Research and Enterprise Systems
dc.relation.isbasedon	10.5220/0010772400003117
dc.rights	info:eu-repo/semantics/openAccess
dc.title	An Efficient Relax-and-Solve Algorithm for the Resource-Constrained Project Scheduling Problem
dc.type	Conference Proceeding
utslib.location.activity	online
pubs.organisational-group	/University of Technology Sydney
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	open_access	*
pubs.consider-herdc	true
dc.date.updated	2023-02-15T10:46:01Z
pubs.finish-date	2022-02-05
pubs.publication-status	Published
pubs.start-date	2022-02-03

Abstract:

The resource-constrained project scheduling problem (RCPSP) has a broad range of practical applications, e.g., in manufacturing, mining, and supply chain, among others(Kreter et al., 2015). Over the last 50 years, many researchers have tried to solve this challenging NP-hard problem. This paper presents an efficient and easy-to-implement relax-and-solve matheuristic to solve RCPSP. The proposed method employs constraint programming in a heuristic framework and uses CPLEX as an optimization solver. This algorithm is tested on more than 1500 instances from the standard library PSPLIB. Our experimental results show that the proposed heuristic framework outperforms the CPLEX and provides competitive results compared with the state-of-the-art techniques.

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

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