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

Task allocation of human-robot collaborative assembly line considering assembly complexity and workload balance

Author

Listed:
  • Min Cai
  • Gen Wang
  • Xinggang Luo
  • Xueqi Xu

Abstract

Human-robot collaboration is increasingly utilised in assembly lines, where task allocation is critical. To address the task allocation problem, this paper first evaluates each assembly task using the indicator of automation potential to determine if a collaborative robot can complete it. The method for evaluating assembly complexity and workload is then introduced, which determines the assembly complexity of each task for both robots and workers, as well as the workload for workers. Based on the above indicators, a new task allocation optimisation model for the human-robot collaborative assembly line is established with the objectives of minimising the cycle time, minimising the workload variance between different workstations, and the assembly complexity per unit product. An improved multi-objective migratory bird optimisation algorithm with fast non-dominated sorting is developed to solve the mathematical model of this task allocation. Finally, the proposed method is applied to an assembly line in a real enterprise. The results of algorithm comparisons show that the proposed algorithm is effective, and some managerial insights are also derived from the experimental tests. The result shows that the study effectively reduces product assembly complexity and balances workers’ workload across stations while maintaining assembly efficiency.

Suggested Citation

  • Min Cai & Gen Wang & Xinggang Luo & Xueqi Xu, 2025. "Task allocation of human-robot collaborative assembly line considering assembly complexity and workload balance," International Journal of Production Research, Taylor & Francis Journals, vol. 63(13), pages 4749-4775, July.
  • Handle: RePEc:taf:tprsxx:v:63:y:2025:i:13:p:4749-4775
    DOI: 10.1080/00207543.2024.2442546
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/00207543.2024.2442546?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:13:p:4749-4775. 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.