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

A novel shuffled frog-leaping algorithm with reinforcement learning for distributed assembly hybrid flow shop scheduling

Author

Listed:
  • Jingcao Cai
  • Deming Lei
  • Jing Wang
  • Lei Wang

Abstract

Distributed hybrid flow shop scheduling (DHFS) problem has attracted much attention in recent years; however, DHFS with actual processing constraints like assembly is seldom considered and reinforcement learning is hardly embedded into meta-heuristic for DHFS. In this study, a distributed assembly hybrid flow shop scheduling (DAHFS) problem with fabrication, transportation and assembly is considered and a mathematic model is constructed. A new shuffled frog-learning algorithm with Q-learning (QSFLA) is proposed to minimise makespan. A three-string representation is used. A newly defined Q-learning process is embedded into QSFLA to select a search strategy dynamically for memeplex search. It is composed of four actions based on the combination of global search, neighbourhood search and solution acceptance rule, six states depicted by population evaluation on elite solution and diversity, and a newly defined reward function. A number of experiments are conducted. The computational results demonstrate that QSFLA can provide promising results on the considered DAHFS.

Suggested Citation

  • Jingcao Cai & Deming Lei & Jing Wang & Lei Wang, 2023. "A novel shuffled frog-leaping algorithm with reinforcement learning for distributed assembly hybrid flow shop scheduling," International Journal of Production Research, Taylor & Francis Journals, vol. 61(4), pages 1233-1251, February.
  • Handle: RePEc:taf:tprsxx:v:61:y:2023:i:4:p:1233-1251
    DOI: 10.1080/00207543.2022.2031331
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/00207543.2022.2031331?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:4:p:1233-1251. 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.