A multi-layered disassembly sequence planning method to support decision making in de-manufacturing

Sadhana ◽  
2021 ◽  
Vol 46 (2) ◽  
Author(s):  
Gulivindala Anil Kumar ◽  
M V A Raju Bahubalendruni ◽  
V S S Prasad ◽  
K Sankaranarayanasamy
2020 ◽  
Vol 106 (9-10) ◽  
pp. 4611-4622 ◽  
Author(s):  
Xuhui Xia ◽  
Huixian Zhu ◽  
Zelin Zhang ◽  
Xiang Liu ◽  
Lei Wang ◽  
...  

Author(s):  
Zude Zhou ◽  
Jiayi Liu ◽  
Duc Truong Pham ◽  
Wenjun Xu ◽  
F Javier Ramirez ◽  
...  

Remanufacturing has gained increasing attention due to its economic, environmental and societal benefits as well as its contribution to the sustainability of natural resources. Disassembly is the first and usually the most difficult process in remanufacturing a product. Disassembly sequence planning, which aims to find the optimal disassembly sequence, is required to improve efficiency and reduce cost. There have been many investigations in this field and several disassembly sequence planning methods have been developed. This article reviews the main existing disassembly sequence planning methods from the perspectives of disassembly mode, disassembly modelling and planning method. The characteristics of different methods are analysed and summarised from those perspectives. Future trends in disassembly sequence planning are also discussed to reveal gaps in existing research.


1992 ◽  
Vol 12 (3) ◽  
pp. 31-38 ◽  
Author(s):  
K. Yokota ◽  
D.R. Brough

Author(s):  
Fei Tao ◽  
Luning Bi ◽  
Ying Zuo ◽  
A. Y. C. Nee

Disassembly is a very important step in recycling and maintenance, particularly for energy saving. However, disassembly sequence planning (DSP) is a challenging combinatorial optimization problem due to complex constraints of many products. This paper considers partial and parallel disassembly sequence planning for solving the degrees-of-freedom in modular product design, considering disassembly time, cost, and energy consumption. An automatic self-decomposed disassembly precedence matrix (DPM) is designed to generate partial/parallel disassembly sequence for reducing complexity and improving efficiency. A Tabu search-based hyper heuristic algorithm with exponentially decreasing diversity management strategy is proposed. Compared with the low-level heuristics, the proposed algorithm is more efficient in terms of exploration ability and improving energy benefits (EBs). The comparison results of three different disassembly strategies prove that the partial/parallel disassembly has a great advantage in reducing disassembly time, and improving EBs and disassembly profit (DP).


Sign in / Sign up

Export Citation Format

Share Document