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

Scheduling hybrid flow shop problem with non-fixed availability constraints

Author

Listed:
  • Walid Besbes
  • Jacques Teghem
  • Taicir Loukil

Abstract

In this study, we deal with a k-stage hybrid flow shop scheduling problem under availability constraints (HFSPAC). In such a problem, machines are not continuously available due to preventive maintenance tasks. Our study aims to provide a good approximate solution to this specific problem with the makespan minimisation as the performance measure. Few studies exist in the literature dealing with the HFSPAC. We consider in this paper two variants to tackle this problem. In the first, the starting times of maintenance tasks are fixed, whereas in the second variant, maintenance must be performed on given time windows. In this last case, a theoretical analysis is elaborated based on the machine idle time to decide which action to perform between left-shifting or right-shifting the maintenance task in the window. Due to the NP-hardness of the HFSPAC, an approximate approach, based on a genetic algorithm (GA), is proposed to minimise the makespan. Computational experiments are performed on randomly generated instances to show the efficiency of the proposed variant (flexibility of the starting times of the maintenance tasks) in terms of makespan minimisation. Moreover, a correlation function computation is proposed to statistically analyse these experiments. [Received 7 November 2008; Revised 30 May 2009; Accepted 6 December 2009]

Suggested Citation

  • Walid Besbes & Jacques Teghem & Taicir Loukil, 2010. "Scheduling hybrid flow shop problem with non-fixed availability constraints," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 4(4), pages 413-433.
    • Handle: RePEc:ids:eujine:v:4:y:2010:i:4:p:413-433
    as

    Download full text from publisher

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

    Citations

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


    Cited by:

    1. Wahiba Jomaa & Mansour Eddaly & Bassem Jarboui, 2021. "Variable neighborhood search algorithms for the permutation flowshop scheduling problem with the preventive maintenance," Operational Research, Springer, vol. 21(4), pages 2525-2542, December.
    2. Pan, Quan-Ke & Ruiz, Rubén, 2012. "An estimation of distribution algorithm for lot-streaming flow shop problems with setup times," Omega, Elsevier, vol. 40(2), pages 166-180, April.
    3. Geurtsen, M. & Didden, Jeroen B.H.C. & Adan, J. & Atan, Z. & Adan, I., 2023. "Production, maintenance and resource scheduling: A review," European Journal of Operational Research, Elsevier, vol. 305(2), pages 501-529.

    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:4:y:2010:i:4:p:413-433. 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.