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

Large neighborhood search for an aeronautical assembly line time-constrained scheduling problem with multiple modes and a resource leveling objective

Author

Listed:
  • Tamara Borreguero Sanchidrián

    (AIRBUS
    ETSII, Universidad Politécnica de Madrid)

  • Tom Portoleau

    (Université de Toulouse)

  • Christian Artigues

    (Université de Toulouse)

  • Alvaro García Sánchez

    (ETSII, Universidad Politécnica de Madrid)

  • Miguel Ortega Mier

    (ETSII, Universidad Politécnica de Madrid)

  • Pierre Lopez

    (Université de Toulouse)

Abstract

This paper deals with a scheduling problem arising at the tactical decision level in aeronautical assembly line. It has the structure of a challenging multi-mode resource-constrained project scheduling problem with incompatibility constraints, a resource leveling objective and also a large number of tasks. We first present a new event-based mixed-integer linear programming formulation and a standard constraint programming formulation of the problem. A large-neighborhood search approach based on the constraint programming model and tailored to the resource leveling objective is proposed. The approaches are tested and compared using industrial instances, yielding significant improvement compared to the heuristic currently used by the company. Moreover, the large-neighborhood search method significantly improves the method proposed in the literature on a related multi-mode resource investment problem when short CPU times are required.

Suggested Citation

  • Tamara Borreguero Sanchidrián & Tom Portoleau & Christian Artigues & Alvaro García Sánchez & Miguel Ortega Mier & Pierre Lopez, 2024. "Large neighborhood search for an aeronautical assembly line time-constrained scheduling problem with multiple modes and a resource leveling objective," Annals of Operations Research, Springer, vol. 338(1), pages 13-40, July.
    • Handle: RePEc:spr:annopr:v:338:y:2024:i:1:d:10.1007_s10479-023-05629-3
    DOI: 10.1007/s10479-023-05629-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-023-05629-3
    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-05629-3?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:338:y:2024:i:1:d:10.1007_s10479-023-05629-3. 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.