IDEAS home Printed from https://ideas.repec.org/a/ids/ijmore/v14y2019i2p268-289.html
   My bibliography  Save this article

Robust and stable flexible job shop scheduling with random machine breakdowns: multi-objectives genetic algorithm approach

Author

Listed:
  • Seyed Mojtaba Sajadi
  • Azar Alizadeh
  • Mostafa Zandieh
  • Fereshteh Tavan

Abstract

In this paper, robust and stable scheduling for a flexible job-shop problem with random machine breakdowns has been discussed. A two-stage genetic algorithm is used to generate the predictive schedule. The first stage optimises the primary objective, which minimises the makespan, where all data is considered to be deterministic with no expected disruptions. The second stage optimises two objectives, makespan and stability, function in the presence of random machine breakdowns. For the second stage two different versions of multi-objective genetic algorithm, non-dominated sorting genetic algorithm II and non-dominated ranking genetic algorithm, is used. A simulator is proposed to simulate random machine breakdowns. An experimental study and analysis of variance is conducted to study the results of each multi-objective algorithm and breakdown simulator. The results of their comparison indicate that, non-dominated ranking genetic algorithm (NRGA) performs better and also shows a significant difference between various repair times in the proposed breakdown simulator.

Suggested Citation

  • Seyed Mojtaba Sajadi & Azar Alizadeh & Mostafa Zandieh & Fereshteh Tavan, 2019. "Robust and stable flexible job shop scheduling with random machine breakdowns: multi-objectives genetic algorithm approach," International Journal of Mathematics in Operational Research, Inderscience Enterprises Ltd, vol. 14(2), pages 268-289.
    • Handle: RePEc:ids:ijmore:v:14:y:2019:i:2:p:268-289
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=97759
    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:ijmore:v:14:y:2019:i:2:p:268-289. 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=320 .

    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.