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

Integrated scheduling of multi-objective lot-streaming hybrid flowshop with AGV based on deep reinforcement learning

Author

Listed:
  • Hongtao Tang
  • Jiawei Huang
  • Chenhao Ren
  • Yiping Shao
  • Jiansha Lu

Abstract

The conventional approach to shop floor scheduling often overlooks handling time, either neglecting it or assimilating it into processing time. This results in inadequate information sharing, hindering operational synergy and impeding overall optimisation. Addressing this issue, this study focuses on the three-stage lot-streaming hybrid flowshop scheduling problem with automated guided vehicles (LSHFSP-AGV). It introduces a multi-objective scheduling model to enhance collaboration between machine production and AGV distribution, three objectives of minimum maximum completion time, minimum total machine idle time, and shortest AGV transportation distance are set. An improved multi-objective double-depth Q learning algorithm (NSGA2-MDDQN) based on NSGA-II is proposed to solve the problem. Taguchi experiments were conducted to determine the optimal parameter combination among alternative parameter combinations, and extensive numerical experiments involving 27 instances demonstrated the superiority of NSGA2-MDDQN over combinatorial scheduling rules, MDDQN, and NSGA-II, proving the superiority of the algorithm. The experimental results show that on the objective of minimising makespan, NSGA2-MDDQN reduces by an average of 23.17% compared to the composite scheduling rule, NSGA-II and MDDQN. And achieving an average reduction of 43.78% in machine idle time, and 9.12% in AGV transport distance.

Suggested Citation

  • Hongtao Tang & Jiawei Huang & Chenhao Ren & Yiping Shao & Jiansha Lu, 2025. "Integrated scheduling of multi-objective lot-streaming hybrid flowshop with AGV based on deep reinforcement learning," International Journal of Production Research, Taylor & Francis Journals, vol. 63(4), pages 1275-1303, February.
  • Handle: RePEc:taf:tprsxx:v:63:y:2025:i:4:p:1275-1303
    DOI: 10.1080/00207543.2024.2373426
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/00207543.2024.2373426?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:63:y:2025:i:4:p:1275-1303. 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.