Publication
Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers
| dc.contributor.author | Coelho, José | |
| dc.contributor.author | Vanhoucke, Mario | |
| dc.date.accessioned | 2011-05-09T16:54:56Z | |
| dc.date.available | 2011-05-09T16:54:56Z | |
| dc.date.issued | 2011-03 | |
| dc.description.abstract | This paper reports on a new solution approach for the well-known multi-mode resource-constrained project scheduling problem (MRCPSP). This problem type aims at the selection of a single activity mode from a set of available modes in order to construct a precedence and a (renewable and non-renewable) resource feasible project schedule with a minimal makespan. The problem type is known to be NP-hard and has been solved using various exact as well as (meta-)heuristic procedures. The new algorithm splits the problem type into a mode assignment and a single mode project scheduling step. The mode assignment step is solved by a satisfiability (SAT) problem solver and returns a feasible mode selection to the project scheduling step. The project scheduling step is solved using an efficient meta-heuristic procedure from literature to solve the resource-constrained project scheduling problem (RCPSP). However, unlike many traditional meta-heuristic methods in literature to solve the MRCPSP, the new approach executes these two steps in one run, relying on a single priority list. Straightforward adaptations to the pure SAT solver by using pseudo boolean non-renewable resource constraints has led to a high quality solution approach in a reasonable computational time. Computational results show that the procedure can report similar or sometimes even better solutions than found by other procedures in literature, although it often requires a higher CPU time. | por |
| dc.identifier.citation | Coelho, José; Vanhoucke, Mario - Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers. "European Journal of Operational Research" [Em linha]. ISSN 0377-2217. Vol. 213, Issue 1 (2011), p. 73-82 | por |
| dc.identifier.issn | 0377-2217 | |
| dc.identifier.uri | http://hdl.handle.net/10400.2/1790 | |
| dc.language.iso | eng | por |
| dc.peerreviewed | yes | por |
| dc.publisher | ELSEVIER | por |
| dc.relation.publisherversion | http://dx.doi.org/10.1016/j.ejor.2011.03.019 | por |
| dc.subject | Project scheduling | por |
| dc.subject | SAT | por |
| dc.subject | Multi-mode RCPSP | por |
| dc.title | Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers | por |
| dc.type | journal article | |
| dspace.entity.type | Publication | |
| oaire.citation.endPage | 82 | por |
| oaire.citation.startPage | 73 | por |
| person.familyName | Coelho | |
| person.familyName | Vanhoucke | |
| person.givenName | José | |
| person.givenName | Mario | |
| person.identifier | R-000-8V7 | |
| person.identifier.ciencia-id | 7D18-9842-159F | |
| person.identifier.orcid | 0000-0002-5855-284X | |
| person.identifier.orcid | 0000-0001-6702-3563 | |
| person.identifier.rid | D-8647-2015 | |
| person.identifier.scopus-author-id | 6507772652 | |
| rcaap.rights | restrictedAccess | por |
| rcaap.type | article | por |
| relation.isAuthorOfPublication | 2926ed15-fe04-4ee4-a40d-ad0a83e33af8 | |
| relation.isAuthorOfPublication | 129fc49c-d742-406a-b680-f5544f8da0e2 | |
| relation.isAuthorOfPublication.latestForDiscovery | 129fc49c-d742-406a-b680-f5544f8da0e2 |