IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v62y2024i12p4226-4244.html
   My bibliography  Save this article

A multi-objective discrete differential evolution algorithm for energy-efficient distributed blocking flow shop scheduling problem

Author

Listed:
  • Fuqing Zhao
  • Hui Zhang
  • Ling Wang
  • Tianpeng Xu
  • Ningning Zhu
  • Jonrinaldi Jonrinaldi

Abstract

The energy problem in green manufacturing has attracted enormous attention from researchers and practitioners in the manufacturing domain with the global energy crisis and the aggravation of environmental pollution. The distributed blocking flow shop scheduling problem (DBFSP) has considerable application scenarios in connection with its widespread application in the industry under the background of intelligent manufacturing. A multi-objective discrete differential evolution (MODE) algorithm is proposed to solve the energy-efficient distributed blocking flow shop scheduling problem (EEDBFSP) with the objectives of the makespan and total energy consumption (TEC) in this paper. The cooperative initialisation strategy is proposed to generate the initial population of the EEDBFSP. The mutation, crossover, and selection operators are redesigned to enable the MODE algorithm as applied to discrete space. A local search strategy based on the knowledge of five operators is introduced to enhance the exploitation capability of the MODE algorithm in the EEDBFSP. The non-critical path energy-efficient strategy is proposed to reduce energy consumption according to the specific constraints in the EEDBFSP. The effectiveness of each strategy in the MODE algorithm is verified and compared with the state-of-the-art algorithms. The numerical results demonstrate that the MODE algorithm is the efficient optimiser for solving the EEDBFSP.

Suggested Citation

  • Fuqing Zhao & Hui Zhang & Ling Wang & Tianpeng Xu & Ningning Zhu & Jonrinaldi Jonrinaldi, 2024. "A multi-objective discrete differential evolution algorithm for energy-efficient distributed blocking flow shop scheduling problem," International Journal of Production Research, Taylor & Francis Journals, vol. 62(12), pages 4226-4244, June.
  • Handle: RePEc:taf:tprsxx:v:62:y:2024:i:12:p:4226-4244
    DOI: 10.1080/00207543.2023.2254858
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2023.2254858
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2023.2254858?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.

    More about this item

    Statistics

    Access and download statistics

    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:taf:tprsxx:v:62:y:2024:i:12:p:4226-4244. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.