Heuristic Solution Methods for the Selective Disassembly Sequencing Problem under Sequence-Dependent Costs

Abstract This paper addresses the disassembly sequencing problem for selective and sequential disassembly under sequence-dependent costs. As optimal formulations fail to handle real-world cases, we develop a randomized greedy algorithm and a matheuristic to solve efficiently medium to large-sized instances. Contrary to metaheuristics that have been widely adopted to solve this problem, our approach only needs a very few number of parameters to be set and proved to be robust with respect to their values.