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

A reinforcement learning-driven brain storm optimisation algorithm for multi-objective energy-efficient distributed assembly no-wait flow shop scheduling problem

Author

Listed:
  • Fuqing Zhao
  • Xiaotong Hu
  • Ling Wang
  • Tianpeng Xu
  • Ningning Zhu
  • Jonrinaldi

Abstract

A reinforcement learning-driven brain storm optimisation idea (RLBSO) is proposed in this paper to solve multi-objective energy-efficient distributed assembly no-wait flow shop scheduling problem. The objectives of the problem include minimising the maximum assembly completion time ( $ {C_{\textrm{max}}} $ Cmax), minimising the total energy consumption (TEC) and achieving resource allocation balanced . Four operations, which are critical factory insert, critical factory swap, critical factory insert to other factories, critical factory swap with other factories, are designed to optimise the objective of maximum assembly completion time. Q-learning mechanism is utilised to guide the selection of operations to avoid blind search in the iteration process. The learning mechanism based on clustering mechanism in brain storm optimisation algorithm is utilised to assign products to factories in the objective space according to the processing time of products to balance the resources allocation. The speed of operations on non-critical path is slowed down to reduce TEC regarded with the characteristics of no-wait flow shop scheduling problem. The experimental results under 810 large-scale instances by RLBSO show that the RLBSO outperforms the comparison algorithm for addressing the problem.

Suggested Citation

  • Fuqing Zhao & Xiaotong Hu & Ling Wang & Tianpeng Xu & Ningning Zhu & Jonrinaldi, 2023. "A reinforcement learning-driven brain storm optimisation algorithm for multi-objective energy-efficient distributed assembly no-wait flow shop scheduling problem," International Journal of Production Research, Taylor & Francis Journals, vol. 61(9), pages 2853-2871, May.
  • Handle: RePEc:taf:tprsxx:v:61:y:2023:i:9:p:2853-2871
    DOI: 10.1080/00207543.2022.2070786
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/00207543.2022.2070786?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:61:y:2023:i:9:p:2853-2871. 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.