IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v49y2025i3d10.1007_s10878-025-01270-x.html
   My bibliography  Save this article

Improved black widow optimization algorithm for multi-objective hybrid flow shop batch-scheduling problem

Author

Listed:
  • Xiyang Liu

    (Shenyang Jianzhu University)

  • Fangjun Luan

    (Shenyang Jianzhu University)

Abstract

Sustainable scheduling is getting more and more attention with economic globalization and sustainable manufacturing. However, fewer studies on the batch scheduling problem consider energy consumption. This paper conducts an investigation into the multi-objective hybrid flow shop batch-scheduling problem with the objectives of minimizing both the makespan and electrical energy consumption. The study aims to select the optimal scheduling solution for the problem by considering batch splitting for all products. In this paper, we propose an improved black widow optimization (IBWO) algorithm to study the problem, which incorporates procreation, cannibalism, and mutation behaviors to maintain the population’s diversity and stability. To achieve our objectives, we use the dynamic entropy weight topsis method to select individual spiders. Finally, we use the nature theorem construction method, which relies on the property theorem, to solve the Pareto solution set and derive the optimization scheme for the hybrid flow shop batch scheduling problem. We verify the effectiveness of the proposed IBWO on instances of varying sizes. When we keep all other factors and cases constant, we compare the IBWO to the NSGA2 algorithm and find that it converges faster for both goals and has lower goals than the NSGA2.

Suggested Citation

  • Xiyang Liu & Fangjun Luan, 2025. "Improved black widow optimization algorithm for multi-objective hybrid flow shop batch-scheduling problem," Journal of Combinatorial Optimization, Springer, vol. 49(3), pages 1-29, April.
  • Handle: RePEc:spr:jcomop:v:49:y:2025:i:3:d:10.1007_s10878-025-01270-x
    DOI: 10.1007/s10878-025-01270-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-025-01270-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10878-025-01270-x?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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:spr:jcomop:v:49:y:2025:i:3:d:10.1007_s10878-025-01270-x. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.