IDEAS home Printed from https://ideas.repec.org/a/ids/ijmore/v2y2010i6p748-761.html
   My bibliography  Save this article

An efficient algorithm for the multi-mode resource constrained project scheduling problem with resource flexibility

Author

Listed:
  • Najib M. Najid
  • Marouane Arroub

Abstract

The scheduling problem under study may be viewed as an extension of the standard multi-mode resource-constrained project scheduling problem (MRCPSP) including multi-skilled labour and will be called as MRCPSP-MS. This problem requires an integration of resource limitation, labour skills and multiple possible execution modes for each task, and the objective is to minimise the overall project duration. This paper present a new tabu search (TS) algorithm using a powerful neighbourhood function based on a flow graph representation in order to implement various search strategies. The search of the solution space is carried out via two types of moves. Furthermore, the TS algorithm is embedded in a decomposition-based heuristic (DBH) which serve to reduce the solution space. The effectiveness of the new TS is demonstrated through extensive experimentation on different standard benchmark problem instances and proves that our results are competitive.

Suggested Citation

  • Najib M. Najid & Marouane Arroub, 2010. "An efficient algorithm for the multi-mode resource constrained project scheduling problem with resource flexibility," International Journal of Mathematics in Operational Research, Inderscience Enterprises Ltd, vol. 2(6), pages 748-761.
    • Handle: RePEc:ids:ijmore:v:2:y:2010:i:6:p:748-761
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=35497
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:ids:ijmore:v:2:y:2010:i:6:p:748-761. See general information about how to correct material in RePEc.

    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 bibliographic 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=320 .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.