Optimising work-sharing in disassembly line balancing problems: a multi-cycle strategy.

Saved in:
Bibliographic Details
Title: Optimising work-sharing in disassembly line balancing problems: a multi-cycle strategy.
Authors: Li, Min1 (AUTHOR), Zhou, Binghai1 (AUTHOR) bhzhou@tongji.edu.cn
Source: International Journal of Production Research. Sep2025, Vol. 63 Issue 18, p6827-6854. 28p.
Subjects: Assembly line balancing, Work sharing, Engineering systems, Turnaround time, Algorithms, Resource allocation, Mixed integer linear programming, Optimization algorithms
Abstract: To improve workload balance and reduce cycle time in disassembly line balancing problems, a multi-cycle work-sharing strategy that allows tasks to be reassigned across sub-cycles is proposed for the first time. While this strategy enhances disassembly efficiency, it also increases total resource demands, as different tasks may require distinct resources for effective execution. Therefore, to effectively address this challenge, a bi-objective integer linear programming model is established with the goal of minimising both overall cycle time and total resource count. The epsilon constraint method is then employed to obtain solutions for small-scale problems. For large-scale problems, a Double Deep Q-Network-based Hyper-Heuristic (DDQN-HH) algorithm is developed. This approach incorporates specialised encoding and decoding strategies, two state functions, and eight heuristic action rules to enhance its effectiveness. And comparative experiments using multi-objective evaluation metrics demonstrate the DDQN-HH algorithm's superiority over three other leading algorithms: the Deep Q-Network-based Hyper Heuristic (DQN-HH) algorithm, the Random, Greedy-based Hyper Heuristic (RG-HH) algorithm, and the Multi-objective Equilibrium Optimiser (MOEO) algorithm. Furthermore, the DDQN-HH's practical significance in addressing real-world engineering problems is validated through managerial applications. [ABSTRACT FROM AUTHOR]
Copyright of International Journal of Production Research is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Full text is not displayed to guests.
Description
Abstract:To improve workload balance and reduce cycle time in disassembly line balancing problems, a multi-cycle work-sharing strategy that allows tasks to be reassigned across sub-cycles is proposed for the first time. While this strategy enhances disassembly efficiency, it also increases total resource demands, as different tasks may require distinct resources for effective execution. Therefore, to effectively address this challenge, a bi-objective integer linear programming model is established with the goal of minimising both overall cycle time and total resource count. The epsilon constraint method is then employed to obtain solutions for small-scale problems. For large-scale problems, a Double Deep Q-Network-based Hyper-Heuristic (DDQN-HH) algorithm is developed. This approach incorporates specialised encoding and decoding strategies, two state functions, and eight heuristic action rules to enhance its effectiveness. And comparative experiments using multi-objective evaluation metrics demonstrate the DDQN-HH algorithm's superiority over three other leading algorithms: the Deep Q-Network-based Hyper Heuristic (DQN-HH) algorithm, the Random, Greedy-based Hyper Heuristic (RG-HH) algorithm, and the Multi-objective Equilibrium Optimiser (MOEO) algorithm. Furthermore, the DDQN-HH's practical significance in addressing real-world engineering problems is validated through managerial applications. [ABSTRACT FROM AUTHOR]
ISSN:00207543
DOI:10.1080/00207543.2025.2489041