Mathematical Formulations for Asynchronous Parallel Disassembly Planning of End-of-Life Products

Disassembly is one of the most time-consuming and labor-intensive activities during the value recovery of end-of-life (EOL) products. The completion time (makespan) of disassembling EOL products is highly associated with the allocation of operators, especially in parallel disassembly. In this paper,...

Full description

Saved in:
Bibliographic Details
Published inMathematics (Basel) Vol. 10; no. 20; p. 3854
Main Authors Meng, Leilei, Zhang, Biao, Ren, Yaping, Sang, Hongyan, Gao, Kaizhou, Zhang, Chaoyong
Format Journal Article
LanguageEnglish
Published Basel MDPI AG 01.10.2022
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:Disassembly is one of the most time-consuming and labor-intensive activities during the value recovery of end-of-life (EOL) products. The completion time (makespan) of disassembling EOL products is highly associated with the allocation of operators, especially in parallel disassembly. In this paper, asynchronous parallel disassembly planning (APDP), which avoids the necessity to synchronize disassembly tasks of manipulators during the parallel disassembly process, is studied to optimize the task assignment of manipulators for minimal makespan. We utilize four mixed integer linear programming (MILP) formulations to identify the optimal solutions. A set of different-sized instances are used to test and compare the performance of the proposed models, including some real-world cases. Finally, the proposed exact algorithm is further compared with the existing approach to solving APDP. Results indicate that a significant difference exists in terms of the computational efficiency of the MILP models, while three of four MILP formulations can efficiently achieve better solutions than that of the existing approach.
ISSN:2227-7390
2227-7390
DOI:10.3390/math10203854