Repository logo
 
Publication

Going to the core of hard resource-constrained project scheduling instances

2020-09Journal article Restricted access
Simple item page
dc.contributor.authorCoelho, José
dc.contributor.authorVanhoucke, Mario
dc.date.accessioned2022-11-18T09:42:35Z
dc.date.available2022-11-18T09:42:35Z
dc.date.issued2020-09
dc.description.abstractThe resource-constrained project scheduling problem (RCPSP) is one of the most studied problems in the project scheduling literature, and aims at constructing a project schedule with a minimum makespan that satisfies both the precedence relations of the network and the limited availability of the renewable resources. The problem has attracted attention due to its NP hardness status, and different algorithms have been proposed that solve a wide variety of RCPSP instances to optimality or near-optimality. In this paper, we analyse the hardness of this problem from an experimental point-of-view by testing different algorithms on a huge set of existing instances and detect which ones are difficult to solve. To that purpose, we propose a three-phased approach that makes use of five elementary blocks, well-performing algorithms and a huge amount of computational power to transform easy RCPSP instances into very hard ones. The purpose of this study is to create insight and understanding into what makes an RCPSP instance hard, and propose a new dataset that consists of a small set of instances that are impossible to solve with the algorithms currently existing in the literature. These instances should be as small as possible in terms of number of activities and resources, and should be as diverse as possible in terms of network structure and resource strictness. Such a dataset should enable researchers to focus their attention on the development of radically new algorithms to solve the RCPSP rather than gradually improving current algorithms that can solve the existing RCPSP instances only slightly better.pt_PT
dc.description.versioninfo:eu-repo/semantics/publishedVersionpt_PT
dc.identifier.citationCoelho, J., & Vanhoucke, M. (2020). Going to the core of hard resource-constrained project scheduling instances. Computers & Operations Research, 121, 104976. https://doi.org/10.1016/j.cor.2020.104976pt_PT
dc.identifier.doihttps://doi.org/10.1016/j.cor.2020.104976pt_PT
dc.identifier.eissn1873-765X
dc.identifier.issn0305-0548 (Print)
dc.identifier.urihttp://hdl.handle.net/10400.2/12598
dc.language.isoengpt_PT
dc.peerreviewedyespt_PT
dc.publisherELSEVIERpt_PT
dc.subjectResource-constrained project schedulingpt_PT
dc.subjectProject networkspt_PT
dc.subjectResource constraintspt_PT
dc.titleGoing to the core of hard resource-constrained project scheduling instancespt_PT
dc.typejournal article
dspace.entity.typePublication
oaire.citation.endPage17pt_PT
oaire.citation.startPage1pt_PT
oaire.citation.titleComputers & Operations Researchpt_PT
person.familyNameCoelho
person.familyNameVanhoucke
person.givenNameJosé
person.givenNameMario
person.identifierR-000-8V7
person.identifier.ciencia-id7D18-9842-159F
person.identifier.orcid0000-0002-5855-284X
person.identifier.orcid0000-0001-6702-3563
person.identifier.ridD-8647-2015
person.identifier.scopus-author-id6507772652
rcaap.rightsrestrictedAccesspt_PT
rcaap.typearticlept_PT
relation.isAuthorOfPublication2926ed15-fe04-4ee4-a40d-ad0a83e33af8
relation.isAuthorOfPublication129fc49c-d742-406a-b680-f5544f8da0e2
relation.isAuthorOfPublication.latestForDiscovery129fc49c-d742-406a-b680-f5544f8da0e2

Files

Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Coelho e Vanhoucke - 2020 - Going to the core of hard resource-constrained pro.pdf
Size:
1.72 MB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.97 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Ciências e Tecnologia | Artigos em revistas internacionais / Papers in international journals