IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v58y2020i23p7149-7166.html
   My bibliography  Save this article

Mixed-integer/linear and constraint programming approaches for activity scheduling in a nuclear research facility

Author

Listed:
  • Oliver Polo-Mejía
  • Christian Artigues
  • Pierre Lopez
  • Virginie Basini

Abstract

This paper presents the results of a research project aiming to optimise the scheduling of activities within a research laboratory of the ‘Commissariat à l'Energie Atomique et aux Energies Alternatives (CEA)’. To tackle this problem, we decompose every activity into a set of elementary tasks to apply standard scheduling methods. We model the problem as an extended version of the Multi-Skill Project Scheduling Problem (MSPSP). As a first approach, we propose a Multi-Skill Project Scheduling Problem with penalty for preemption, along with its mixed-integer/linear programming (MILP) formulation, where the preemption is allowed applying a penalty every time an activity is interrupted. However, the previous approach does not take into account all safety constraints at the facility, and a more accurate variant of the problem is needed. We propose then to integrate the concept of partial preemption to the MSPSP. This concept, that has not been yet studied in the scientific literature, implies that only a subset of resources is released during preemption periods. The resulting MSPSP with partial preemption (MSPSP-PP) is modelled using two methodologies: MILP and constraint programming. Regarding the industrial need of having good solutions in a short time, we also present a greedy algorithm for the MSPSP-PP.

Suggested Citation

  • Oliver Polo-Mejía & Christian Artigues & Pierre Lopez & Virginie Basini, 2020. "Mixed-integer/linear and constraint programming approaches for activity scheduling in a nuclear research facility," International Journal of Production Research, Taylor & Francis Journals, vol. 58(23), pages 7149-7166, December.
  • Handle: RePEc:taf:tprsxx:v:58:y:2020:i:23:p:7149-7166
    DOI: 10.1080/00207543.2019.1693654
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2019.1693654
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2019.1693654?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.

    Citations

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


    Cited by:

    1. Min Wang & Guoshan Liu & Xinyu Lin, 2022. "Dynamic Optimization of the Multi-Skilled Resource-Constrained Project Scheduling Problem with Uncertainty in Resource Availability," Mathematics, MDPI, vol. 10(17), pages 1-20, August.
    2. 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.

    More about this item

    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:taf:tprsxx:v:58:y:2020:i:23:p:7149-7166. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.