Review of The Optimization Algorithms for Remanufacturing Disassembly Line

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.