Repository logo
 
Publication

An exact composite lower bound strategy for the resource-constrained project scheduling problem

2018-05Preprint Restricted access
Simple item page
dc.contributor.authorCoelho, José
dc.contributor.authorVanhoucke, Mario
dc.date.accessioned2019-02-04T17:02:09Z
dc.date.available2019-02-04T17:02:09Z
dc.date.issued2018-05
dc.description.abstractThis paper reports on results for the well-known resource-constrained project scheduling problem. A branch-and-bound procedure is developed that takes into account all best performing components from literature, varying branching schemes and search strategies, using the best performing dominance rules and assembling these components into a unified search algorithm. A composite lower bound strategy that statically and dynamically selects the best performing bounds from literature is used to find optimal solutions within reasonable times. An extensive computational experiment is set up to determine the best combination of the various components used in the procedure, in order to benchmark the current existing knowledge on four different datasets from the literature. By varying the network topology, resource scarceness and the size of the projects, the computational experiments are carried out on a diverse set of projects. The procedure was able to find some new lower bounds and optimal solutions for the PSPLIB instances. Moreover, new best known results are reported for other, more diverse datasets that can be used in future research studies. The experiments revealed that even project instances with 30 activities cannot be solved to optimality when the topological structure is varied.pt_PT
dc.description.sponsorshipWe acknowledge the financial support provided by the “Bijzonder Onderzoeksfonds” (BOF) and by the National Bank of Belgium (NBB) for the project with contract number BOF12GOA021 and by the Fundação para a Ciência e Tecnologia with contract number FRH/BSAB/127795/2016. All computational experiments were carried out using the Stevin Supercomputer Infrastructure at Ghent University (Belgium), funded by Ghent University, the Hercules Foundation and the Flemish Government - department EWI.pt_PT
dc.description.sponsorshipFRH/BSAB/127795/2016
dc.description.versioninfo:eu-repo/semantics/publishedVersionpt_PT
dc.identifier.doi10.1016/j.cor.2018.01.017pt_PT
dc.identifier.urihttp://hdl.handle.net/10400.2/7911
dc.language.isoengpt_PT
dc.peerreviewedyespt_PT
dc.publisherElsevierpt_PT
dc.subjectResource-constrained project schedulingpt_PT
dc.subjectBranch-and-boundpt_PT
dc.subjectLower boundspt_PT
dc.titleAn exact composite lower bound strategy for the resource-constrained project scheduling problempt_PT
dc.typepreprint
dspace.entity.typePublication
oaire.citation.endPage150pt_PT
oaire.citation.startPage135pt_PT
oaire.citation.titleComputers and Operations Researchpt_PT
oaire.citation.volume93pt_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.typepreprintpt_PT
relation.isAuthorOfPublication2926ed15-fe04-4ee4-a40d-ad0a83e33af8
relation.isAuthorOfPublication129fc49c-d742-406a-b680-f5544f8da0e2
relation.isAuthorOfPublication.latestForDiscovery2926ed15-fe04-4ee4-a40d-ad0a83e33af8

Files

Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
171218 Coelho and Vanhoucke COR.pdf
Size:
527.3 KB
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