An efficient GRASP algorithm for disassembly sequence planning

One of the steps in a reverse supply chain is to disassemble the recovered products. The design of such disassembly operations is more complex than that of classical assembly lines. A new GRASP algorithm is presented in this paper for solving Disassembly Sequence Planning, i.e. the determination of the sequence for disassembling component parts. The problem has a combinatorial structure and a large number of constraints. Moreover, checking the feasibility of each solution element is time consuming. The proposed approach is successfully tested against previous best known solutions for a set of public benchmark problems.