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

Leilei Meng, Biao Zhang, Yaping Ren (), Hongyan Sang, Kaizhou Gao and Chaoyong Zhang
Additional contact information
Leilei Meng: School of Computer Science, Liaocheng University, Liaocheng 252000, China
Biao Zhang: School of Computer Science, Liaocheng University, Liaocheng 252000, China
Yaping Ren: Department of Industrial Engineering, School of Intelligent Systems Science and Engineering, Jinan University, Zhuhai 519070, China
Hongyan Sang: School of Computer Science, Liaocheng University, Liaocheng 252000, China
Kaizhou Gao: School of Computer Science, Liaocheng University, Liaocheng 252000, China
Chaoyong Zhang: State Key Lab of Digital Manufacturing Equipment and Technology, Huazhong University of Science and Technology, Wuhan 430074, China

Mathematics, 2022, vol. 10, issue 20, 1-16

Abstract: 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.

Keywords: demanufacturing; disassembly planning; asynchronous parallel disassembly; mixed integer linear programming; exact algorithm (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/10/20/3854/pdf (application/pdf)
https://www.mdpi.com/2227-7390/10/20/3854/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:10:y:2022:i:20:p:3854-:d:945305

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().