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

Alireza Etminaniesfahani; Hanyu Gu; Amir Salehipour

Research.Publish.Connect.

*Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search *Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search *Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search *Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Paper

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

Topics: Industrial Engineering; Management Sciences; Optimization; Project Management; Scheduling

In Proceedings of the 11th International Conference on Operations Research and Enterprise Systems ICORES - Volume 1, 271-277, 2022

Authors: Alireza Etminaniesfahani ; Hanyu Gu and Amir Salehipour

Affiliation: School of Mathematical and Physical Sciences, University of Technology Sydney, Australia

Keyword(s): Relax-and-Solve, Project Scheduling, Resource-Constrained Project Scheduling Problem, RCPSP, Makespan, Matheuristic.

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.

CC BY-NC-ND 4.0

Guest: Register as new SciTePress user now for free.

SciTePress user: please login.

My Papers

You are not signed in, therefore limits apply to your IP address 3.15.3.242

In the current month:

Recent papers: 100 available of 100 total

2⁺ years older papers: 200 available of 200 total

Paper citation in several formats:

Etminaniesfahani, A.; Gu, H. and Salehipour, A. (2022). An Efficient Relax-and-Solve Algorithm for the Resource-Constrained Project Scheduling Problem. In Proceedings of the 11th International Conference on Operations Research and Enterprise Systems - ICORES; ISBN 978-989-758-548-7; ISSN 2184-4372, SciTePress, pages 271-277. DOI: 10.5220/0010772400003117

@conference{icores22,
author={Alireza Etminaniesfahani. and Hanyu Gu. and Amir Salehipour.},
title={An Efficient Relax-and-Solve Algorithm for the Resource-Constrained Project Scheduling Problem},
booktitle={Proceedings of the 11th International Conference on Operations Research and Enterprise Systems - ICORES},
year={2022},
pages={271-277},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0010772400003117},
isbn={978-989-758-548-7},
issn={2184-4372},
}

TY - CONF

JO - Proceedings of the 11th International Conference on Operations Research and Enterprise Systems - ICORES
TI - An Efficient Relax-and-Solve Algorithm for the Resource-Constrained Project Scheduling Problem
SN - 978-989-758-548-7
IS - 2184-4372
AU - Etminaniesfahani, A.
AU - Gu, H.
AU - Salehipour, A.
PY - 2022
SP - 271
EP - 277
DO - 10.5220/0010772400003117
PB - SciTePress