IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v337y2024i2d10.1007_s10479-023-05537-6.html
   My bibliography  Save this article

Exact and heuristic methods for Anchor-Robust and Adjustable-Robust RCPSP

Author

Listed:
  • Adèle Pass-Lanneau

    (EDF R &D
    Sorbonne Université, CNRS)

  • Pascale Bendotti

    (EDF R &D
    Sorbonne Université, CNRS)

  • Luca Brunod-Indrigo

    (EDF R &D
    Sorbonne Université, CNRS)

Abstract

The concept of anchored solutions is proposed as a new robust optimization approach to the Resource-Constrained Project Scheduling Problem (RCPSP) under processing times uncertainty. The Anchor-Robust RCPSP is defined, to compute a baseline schedule with bounded makespan, sequencing decisions, and a max-size subset of jobs with guaranteed starting times, called anchored set. It is shown that the Adjustable-Robust RCPSP from the literature fits within the framework of anchored solutions. The Anchor-Robust RCPSP and the Adjustable-Robust RCPSP can benefit from each other to find both a worst-case makespan, and a baseline schedule with an anchored set. A dedicated graph model for anchored solutions is reviewed for budgeted uncertainty. Compact MIP reformulations are derived for both the Adjustable-Robust RCPSP and the Anchor-Robust RCPSP. Dedicated heuristics are designed based on the graph model. For both problems, the efficiency of the proposed MIP reformulations and heuristic approaches is assessed through numerical experiments on benchmark instances.

Suggested Citation

  • Adèle Pass-Lanneau & Pascale Bendotti & Luca Brunod-Indrigo, 2024. "Exact and heuristic methods for Anchor-Robust and Adjustable-Robust RCPSP," Annals of Operations Research, Springer, vol. 337(2), pages 649-682, June.
    • Handle: RePEc:spr:annopr:v:337:y:2024:i:2:d:10.1007_s10479-023-05537-6
    DOI: 10.1007/s10479-023-05537-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-023-05537-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-023-05537-6?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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:spr:annopr:v:337:y:2024:i:2:d:10.1007_s10479-023-05537-6. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.