Abstract
The disassembly line of remanufacturing has significance economic and social value for dealing with the massive increasing number of disposal products. As the typical multi-objective optimization (MOO) problem, the disassembly line balancing problem (DLBP) is one of typical NP-hard problem which has the characteristic of high computational complexity. There has no summarize of MOO algorithms for the remanufacturing DLBP. Therefore, this paper main reviewed three main categories of the optimization algorithms for remanufacturing DLBP and comparing the advantages and disadvantages of various algorithms. Additionally, identify the challenges and future research directions of remanufacturing DLBP.
| Original language | English |
|---|---|
| Title of host publication | 2021 26th International Conference on Automation and Computing |
| Subtitle of host publication | System Intelligence through Automation and Computing, ICAC 2021 |
| Editors | Chenguang Yang |
| Publisher | IEEE |
| ISBN (Electronic) | 9781860435577 |
| DOIs | |
| Publication status | Published - 2 Sept 2021 |
| Event | 26th International Conference on Automation and Computing, ICAC 2021 - Portsmouth, United Kingdom Duration: 2 Sept 2021 → 4 Sept 2021 |
Publication series
| Name | 2021 26th International Conference on Automation and Computing: System Intelligence through Automation and Computing, ICAC 2021 |
|---|
Conference
| Conference | 26th International Conference on Automation and Computing, ICAC 2021 |
|---|---|
| Country/Territory | United Kingdom |
| City | Portsmouth |
| Period | 2/09/21 → 4/09/21 |
Bibliographical note
Funding Information:ACKNOWLEDGMENT The authors acknowledge the financial support of EU H2020 Project RECLAIM (RE-manufaCturing and Refurbishment LArge Industrial equipment) (No. 869884).
Keywords
- Disassembly line balancing problem
- Disassembly sequence scheduling and planning
- DLBP research trends
- Optimization algorithms
- Remanufacturing