IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-04382124.html
   My bibliography  Save this paper

Minimization of Makespan and Total Completion Time for Hybrid Job Shop Scheduling Problem Using Genetic Approaches

Author

Listed:
  • Seifeddine Abdelhak

    (LGI2A - Laboratoire de Génie Informatique et d'Automatique de l'Artois - UA - Université d'Artois)

  • Issam Nouaouri

    (LGI2A - Laboratoire de Génie Informatique et d'Automatique de l'Artois - UA - Université d'Artois)

  • Saoussen Krichen

    (LGI2A - Laboratoire de Génie Informatique et d'Automatique de l'Artois - UA - Université d'Artois)

  • Gilles Goncalves

    (LGI2A - Laboratoire de Génie Informatique et d'Automatique de l'Artois - UA - Université d'Artois)

Abstract

This paper deals with two different versions of Hybrid Job Shop Scheduling Problems (HJSP); the minimization of the maximum completion time (makespan) and the minimization of the total completion time. State of the art shows that the literature on HJSP is rather scarce and that the majority of works concern the general problem called Flexible Job Shop Scheduling Problem (FJSP) in which parallel machines of a stage may have different speeds or yields. We propose the use of a genetic algorithm (GA) and a hybrid version of a GA (HGA) that applies a stochastic local search with two operators, specifically adapted to the HJSP. To conduct a clear statistical study based on the GA, HGA, and other state-of-the-art approaches, we extended our testbed to cover many existing benchmarks. The results of our experimental study show that our proposed algorithms improve the best-known results on a large set of benchmarks found in the literature. The scalability study shows that the proposed algorithm scales better and can deal with larger instances in the literature.

Suggested Citation

  • Seifeddine Abdelhak & Issam Nouaouri & Saoussen Krichen & Gilles Goncalves, 2023. "Minimization of Makespan and Total Completion Time for Hybrid Job Shop Scheduling Problem Using Genetic Approaches," Post-Print hal-04382124, HAL.
    • Handle: RePEc:hal:journl:hal-04382124
    DOI: 10.1142/S0218213023500410
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:hal:journl:hal-04382124. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.