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

Bi-criteria two-machine flow shop scheduling problem involving sequence-dependent setup times and pieces multiplicity

Author

Listed:
  • Djedjiga Ouiddir
  • Mourad Boudhar
  • Karima Bouibede-Hocine

Abstract

This work addresses a just-in-time (JiT) scheduling problem on two-machine flow shop. We consider the case where each order (job) is composed of several pieces with sequence-dependent setup times. This scheduling problem involves the reducing waste, inventory costs and making goods available as and when needed. Here, the jobs incur either penalties or storage costs if they are not completed within their specific due dates. The aim is to obtain a sequence which minimises two criteria: the total weighted earliness and the total weighted tardiness. For the resolution of this problem, we propose a linear mathematical model, three heuristics and two meta-heuristics, the fast and elitist multi-objective genetic algorithm (NSGA-II) and the multi-objective tabu search algorithm (MOTS). The computational experiments, presented and discussed on randomly generated instances, are showed the effectiveness of the proposed model and NSGA-II.

Suggested Citation

  • Djedjiga Ouiddir & Mourad Boudhar & Karima Bouibede-Hocine, 2023. "Bi-criteria two-machine flow shop scheduling problem involving sequence-dependent setup times and pieces multiplicity," International Journal of Mathematics in Operational Research, Inderscience Enterprises Ltd, vol. 24(4), pages 510-536.
    • Handle: RePEc:ids:ijmore:v:24:y:2023:i:4:p:510-536
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=130115
    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:24:y:2023:i:4:p:510-536. 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.