An Economical Approach for Disassembly Sequence Planning

摘要

This article focuses on disassembly sequence planning (DSP) to maximize economical yield by comparing complete disassembly and partial disassembly. In this content, the problem is in NP-complete. Therefore, Genetic algorithm is introduced to solve this problem. To efficiently solve the problem, we introduce a case study of the rice cooker, which consists of 20 disassembly operations, with 596.21 seconds (in total). Finally, results not only show that partial disassembly process in DSP, which conduct in 12 disassembly sequences, provides in higher profits but also yield more profit per day up to 85.46%. Consequently, it is an alternative to be considered in DSP.