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

Human-robot cooperation two-sided partial disassembly line balancing problem

Author

Listed:
  • Mengling Chu
  • Weida Chen

Abstract

Considering the complexities, risks, and uncertainties of disassembling large end-of-life (EOL) products such as cars and buses, a two-sided human-robot disassembly line can utilise both sides of the workstations to enhance efficiency, improve safety, and increase revenue. This paper develops a human-robot cooperation two-sided partial disassembly line balancing model (TPDLB-HRC) to minimise energy consumption and maximise net revenue by addressing four interrelated sub-problems: planning disassembly sequences, selecting disassembly tasks, assigning tasks to mated-stations, and allocating human-robot resources. In addition, a new reinforcement-learning multi-objective evolutionary algorithm based on decomposition (NRL-MOEA/D) is developed, integrating an encoding/decoding scheme, reinforcement learning, problem characteristics, and coevolution between sub-problems to address the above challenges. The effectiveness and superiority of the designed NRL-MOEA/D in solving various cases are tested by comparing it with eleven algorithms. Finally, the applicability of the proposed method is verified by a series of EOL examples, and trade-offs are made under different recycling profits to guide decision-makers in constructing disassembly schemes in real situations.

Suggested Citation

  • Mengling Chu & Weida Chen, 2025. "Human-robot cooperation two-sided partial disassembly line balancing problem," International Journal of Production Research, Taylor & Francis Journals, vol. 63(12), pages 4478-4503, June.
  • Handle: RePEc:taf:tprsxx:v:63:y:2025:i:12:p:4478-4503
    DOI: 10.1080/00207543.2025.2452385
    as

    Download full text from publisher

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

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

    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:12:p:4478-4503. 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.