Publication
A matheuristic for the resource-constrained project scheduling problem
| datacite.subject.sdg | 09:Indústria, Inovação e Infraestruturas | pt_PT |
| datacite.subject.sdg | 12:Produção e Consumo Sustentáveis | pt_PT |
| dc.contributor.author | Vanhoucke, Mario | |
| dc.contributor.author | Coelho, José | |
| dc.date.accessioned | 2024-10-25T09:57:31Z | |
| dc.date.available | 2024-10-25T09:57:31Z | |
| dc.date.issued | 2024-07-19 | |
| dc.description.abstract | This paper presents a matheuristic solution algorithm to solve the well-known resource-constrained project scheduling problem (RCPSP). The problem makes use of a restricted neighbourhood method using an activity selection and a search space restriction module and implements them as two alternative search algorithms. The first algorithm makes use of the best-performing components of the branch-and-bound procedures from the literature, and embeds them into a greedy neighbourhood search. The second matheuristic implements the exact branch-and-bound procedures into a known and well-performing meta-heuristic search algorithm. Computational experiments have been carried out on seven different datasets consisting of 10,000+ project instances. Experiments reveal that the choice of exact algorithm is key in finding high-quality solutions, and illustrate that the trade-off between selecting an activity set size and search space restriction depends on the specific implementation. The computational tests demonstrate that the matheuristic discovered 24 new best known solutions that could not be found by either a meta-heuristic or an exact method individually. Moreover, a new benchmark dataset has been proposed that can be used to develop new matheuristic search procedures to solve the problem consisting of 461 instances from the literature. | pt_PT |
| dc.description.version | info:eu-repo/semantics/publishedVersion | pt_PT |
| dc.identifier.doi | 10.1016/j.ejor.2024.07.016 | pt_PT |
| dc.identifier.uri | http://hdl.handle.net/10400.2/16688 | |
| dc.language.iso | eng | pt_PT |
| dc.peerreviewed | yes | pt_PT |
| dc.publisher | Elsevier | pt_PT |
| dc.subject | Project scheduling | pt_PT |
| dc.subject | Matheuristic | pt_PT |
| dc.subject | Branch-and-bound | pt_PT |
| dc.subject | Project network indicator | pt_PT |
| dc.subject | Neighbourhood search | pt_PT |
| dc.title | A matheuristic for the resource-constrained project scheduling problem | pt_PT |
| dc.type | journal article | |
| dspace.entity.type | Publication | |
| oaire.citation.endPage | 725 | pt_PT |
| oaire.citation.issue | 3 | pt_PT |
| oaire.citation.startPage | 711 | pt_PT |
| oaire.citation.title | European Journal of Operational Research | pt_PT |
| oaire.citation.volume | 319 | pt_PT |
| person.familyName | Vanhoucke | |
| person.familyName | Coelho | |
| person.givenName | Mario | |
| person.givenName | José | |
| person.identifier | R-000-8V7 | |
| person.identifier.ciencia-id | 7D18-9842-159F | |
| person.identifier.orcid | 0000-0001-6702-3563 | |
| person.identifier.orcid | 0000-0002-5855-284X | |
| person.identifier.rid | D-8647-2015 | |
| person.identifier.scopus-author-id | 6507772652 | |
| rcaap.rights | restrictedAccess | pt_PT |
| rcaap.type | article | pt_PT |
| relation.isAuthorOfPublication | 129fc49c-d742-406a-b680-f5544f8da0e2 | |
| relation.isAuthorOfPublication | 2926ed15-fe04-4ee4-a40d-ad0a83e33af8 | |
| relation.isAuthorOfPublication.latestForDiscovery | 129fc49c-d742-406a-b680-f5544f8da0e2 |
Files
Original bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- Vanhoucke e Coelho - 2024 - A matheuristic for the resource-constrained projec.pdf
- Size:
- 1.31 MB
- Format:
- Adobe Portable Document Format
License bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- license.txt
- Size:
- 1.97 KB
- Format:
- Item-specific license agreed upon to submission
- Description: