IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v326y2025i1p54-68.html
   My bibliography  Save this article

Flow-shop and job-shop robust scheduling problems with budgeted uncertainty

Author

Listed:
  • Juvin, Carla
  • Houssin, Laurent
  • Lopez, Pierre

Abstract

In this paper, we study different solution methods for two two-stage robust, multi-machine scheduling problems, namely permutation flow-shop and job-shop scheduling problems under uncertainty budget. Compact formulations of the problems are proposed and two decomposition approaches are presented: a Benders decomposition approach and a column and constraint generation approach. Computational experiments show that for small-sized instances, a compact formulation of the problem quickly yields optimal solutions. However, for larger instances, decomposition methods, particularly the column and constraint generation method with a master problem solved using constraint programming, provide better quality solutions. An acceleration method for the column and constraint generation algorithm is proposed. This method is generic and can be applied to any two-stage robust optimisation problem.

Suggested Citation

  • Juvin, Carla & Houssin, Laurent & Lopez, Pierre, 2025. "Flow-shop and job-shop robust scheduling problems with budgeted uncertainty," European Journal of Operational Research, Elsevier, vol. 326(1), pages 54-68.
    • Handle: RePEc:eee:ejores:v:326:y:2025:i:1:p:54-68
    DOI: 10.1016/j.ejor.2025.04.012
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221725002620
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2025.04.012?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:eee:ejores:v:326:y:2025:i:1:p:54-68. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.