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

A bi-objective MILP model for an open-shop scheduling problem with reverse flows and sequence-dependent setup times

Author

Listed:
  • Saba Aghighi
  • Esmaeil Mehdizadeh
  • Seyed Taghi Akhavan Niaki
  • Amir Abbas Najafi

Abstract

In this research, the scheduling problem of open-shop scheduling problem (OSSP) with sequence-dependent setup time (SDST) is investigated considering the reverse flow (assemble/disassemble flow on the same machines). The problem is formulated as a bi-objective mixed-integer linear programming (MILP) model. It involves reverse flows to minimise the completion time (Cmax) and total tardiness. Since the OSSP is an NP-hard problem, a vibration damping-based multi-objective optimisation algorithm (MOVDO) is employed to solve large test problems in a reasonable runtime. Analysing the results of this algorithm was compared to an Epsilon-constrained method, which produced similar results in small problem sizes. Additionally, this algorithm is compared to other multi-objective algorithms, such as MOACO, MO-Cuckoo search, and NSGA-II, in terms of its performance. Based on the performance of these algorithms, we show that the proposed MOVDO algorithm performs better than the other algorithms to solve this problem. Eventually, a case study is investigated to validate the mathematical model and demonstrate the application. Comparing the proposed model to the results in the real world, the proposed model shows an improvement. [Received: 3 August 2021; Accepted: 2 April 2023]

Suggested Citation

  • Saba Aghighi & Esmaeil Mehdizadeh & Seyed Taghi Akhavan Niaki & Amir Abbas Najafi, 2024. "A bi-objective MILP model for an open-shop scheduling problem with reverse flows and sequence-dependent setup times," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 18(3), pages 433-468.
    • Handle: RePEc:ids:eujine:v:18:y:2024:i:3:p:433-468
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=138222
    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:3:p:433-468. 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.