IDEAS home Printed from https://ideas.repec.org/p/rug/rugwps/09-614.html
   My bibliography  Save this paper

Multi-mode resource constrained pro ject scheduling using RCPSP and SAT solvers

Author

Listed:
  • J. COELHO
  • M. VANHOUCKE

    ()

Abstract

This paper reports on a new solution approach for the well-known multi-mode resource-constrained project scheduling problem (MMRCPSP). 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 NPhard 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 a 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 MMRCPSP, 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 PSPLIB problem instances can be solved better than the current best procedures from literature.

Suggested Citation

  • J. Coelho & M. Vanhoucke, 2009. "Multi-mode resource constrained pro ject scheduling using RCPSP and SAT solvers," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 09/614, Ghent University, Faculty of Economics and Business Administration.
  • Handle: RePEc:rug:rugwps:09/614
    as

    Download full text from publisher

    File URL: http://wps-feb.ugent.be/Papers/wp_09_614.pdf
    Download Restriction: no

    More about this item

    Keywords

    project scheduling; SAT; multi-mode RCPSP;

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:rug:rugwps:09/614. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Nathalie Verhaeghe). General contact details of provider: http://edirc.repec.org/data/ferugbe.html .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.