IDEAS home Printed from https://ideas.repec.org/a/ids/ijpoma/v10y2018i1p1-36.html
   My bibliography  Save this article

A path relinking-based scatter search for the resource-constrained project scheduling problem

Author

Listed:
  • François Berthaut
  • Robert Pellerin
  • Adnène Hajji
  • Nathalie Perrier

Abstract

Project scheduling has received growing attention from researchers in recent decades in order to recommend models and methods to tackle problems for real-size projects. In this paper, we consider the resource-constrained project scheduling problem (RCPSP), which consists of scheduling activities in order to minimise the project duration in presence of precedence and resource constraints. We propose a hybrid metaheuristic based on scatter search that involves forward-backward improvement and reversing the project network at each iteration of the search. A bidirectional path relinking method with a new move is used as a solution combination method and a new improvement procedure is proposed in the reference set update method. The proposed method is applied to the standard benchmark projects from the PSPLIB library. The computational results show that the proposed scatter search produces high-quality solutions in a reasonable computational time and is among the best performing metaheuristics.

Suggested Citation

  • François Berthaut & Robert Pellerin & Adnène Hajji & Nathalie Perrier, 2018. "A path relinking-based scatter search for the resource-constrained project scheduling problem," International Journal of Project Organisation and Management, Inderscience Enterprises Ltd, vol. 10(1), pages 1-36.
    • Handle: RePEc:ids:ijpoma:v:10:y:2018:i:1:p:1-36
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=90372
    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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Milind Jagtap, 2020. "Predicting Penetration of the Project Buffer Time of Critical Chain Project Management (CCPM) Using a Linear Programming Approach," IIM Kozhikode Society & Management Review, , vol. 9(2), pages 143-151, July.
    2. Xabier A. Martin & Rosa Herrero & Angel A. Juan & Javier Panadero, 2024. "An Agile Adaptive Biased-Randomized Discrete-Event Heuristic for the Resource-Constrained Project Scheduling Problem," Mathematics, MDPI, vol. 12(12), pages 1-21, June.

    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:ijpoma:v:10:y:2018:i:1:p:1-36. 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=96 .

    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.