IDEAS home Printed from https://ideas.repec.org/a/ids/eujine/v18y2024i5p669-690.html
   My bibliography  Save this article

A hierarchical approach to schedule the two-machine flow shop problem with flexible periodic synchronised maintenance

Author

Listed:
  • Nahla Chabbah Sekma
  • Hatem Hadda

Abstract

This paper tackles the makespan minimisation for the well-known two-machine flow shop problem with flexible periodic maintenance activities on both machines. The maintenance starting dates are to be decided along with the job's sequence. We adopt a hierarchical approach in which we first decide the job's sequence and then the maintenance starting dates. We identify a dominance rule and a polynomial case, and construct an enhancement procedure. We develop and test several variants of Tabu search and simulated annealing metaheuristics. We also propose an adaptation of the well-known NEH heuristic. The experimental study shows the superiority of one of the variants of simulated annealing and the efficiency of the dominance rule. [Received: 15 July 2022; Accepted: 8 May 2023]

Suggested Citation

  • Nahla Chabbah Sekma & Hatem Hadda, 2024. "A hierarchical approach to schedule the two-machine flow shop problem with flexible periodic synchronised maintenance," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 18(5), pages 669-690.
    • Handle: RePEc:ids:eujine:v:18:y:2024:i:5:p:669-690
    as

    Download full text from publisher

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

    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:eujine:v:18:y:2024:i:5:p:669-690. 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=210 .

    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.