Repository logo
 
Publication

A genetic algorithm for the resource-constrained project scheduling problem with alternative subgraphs using a boolean satisfiability solver

2024-03-04Journal article Restricted access
Simple item page
datacite.subject.sdg09:Indústria, Inovação e Infraestruturaspt_PT
datacite.subject.sdg12:Produção e Consumo Sustentáveispt_PT
dc.contributor.authorServranckx, Tom
dc.contributor.authorCoelho, José
dc.contributor.authorVanhoucke, Mario
dc.date.accessioned2024-10-25T09:48:27Z
dc.date.available2024-10-25T09:48:27Z
dc.date.issued2024-03-04
dc.description.abstractThis study evaluates a new solution approach for the Resource-Constrained Project Scheduling with Alternative Subgraphs (RCPSP-AS) in case that complex relations (i.e. nested and linked alternatives) are considered. In the RCPSP-AS, the project activity structure is extended with alternative activity sequences. This implies that only a subset of all activities should be scheduled, which corresponds with a set of activities in the project network that model an alternative execution mode for a work package. Since only the selected activities should be scheduled, the RCPSP-AS comes down to a traditional RCPSP problem when the selection subproblem is solved. It is known that the RCPSP and, hence, its extension to the RCPSP-AS is NP-hard. Since similar scheduling and selection subproblems have already been successfully solved by satisfiability (SAT) solvers in the existing literature, we aim to test the performance of a GA-SAT approach that is derived from the literature and adjusted to be able to deal with the problem-specific constraints of the RCPSP-AS. Computational results on small and large-scale instances (both artificial and empirical) show that the algorithm can compete with existing metaheuristic algorithms from the literature. Also, the performance is compared with an exact mathematical solver and learning behaviour is observed and analysed. This research again validates the broad applicability of SAT solvers as well as the need to search for better and more suited algorithms for the RCPSP-AS and its extensions.pt_PT
dc.description.versioninfo:eu-repo/semantics/publishedVersionpt_PT
dc.identifier.doi10.1016/j.ejor.2024.02.041pt_PT
dc.identifier.issn0377-2217
dc.identifier.urihttp://hdl.handle.net/10400.2/16686
dc.language.isoengpt_PT
dc.peerreviewedyespt_PT
dc.publisherElsevierpt_PT
dc.subjectProject schedulingpt_PT
dc.subjectAlternative subgraphspt_PT
dc.subjectGenetic algorithmpt_PT
dc.subjectSatisfiability solverpt_PT
dc.titleA genetic algorithm for the resource-constrained project scheduling problem with alternative subgraphs using a boolean satisfiability solverpt_PT
dc.typejournal article
dspace.entity.typePublication
oaire.citation.endPage827pt_PT
oaire.citation.issue3pt_PT
oaire.citation.startPage815pt_PT
oaire.citation.titleEuropean Journal of Operational Researchpt_PT
oaire.citation.volume316pt_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:
Servranckx et al. - 2024 - A genetic algorithm for the Resource-Constrained P.pdf
Size:
915.36 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