This paper deals with disassembly sequencing problems subjected to sequence dependent disassembly costs. We present a heuristic and an iterative method based on partial branch and bound concept to solve such problems. Since heuristic methods intrinsically generate suboptimum solutions, we compared the heuristically obtained solutions with the exact solutions to see if they are reasonably good or not. This process, however, is limited to small or perhaps medium sized problems only as the required CPU time for exact methods tends to increase exponentially with the problem size. For the problems tested, we observed that the methods described in this paper generate surprisingly good results using almost negligible amount of CPU time.


Originally published in the Proceedings of the SPIE International Conference on Environmentally Conscious Manufacturing V, Boston, Massachusetts, pp. 73-80, October 23-24, 2005


disassembly sequencing problems, heuristic method

Subject Categories

Production engineering





Publication Date


Rights Information

Copyright 2005, Society of Photo-Optical Instrumentation Engineers


This paper was published in Proceedings of SPIE (Volume 5997) and is made available as an electronic reprint with permission of SPIE. One print or electronic copy may be made for personal use only. Systematic or multiple reproduction, distribution to multiple locations via electronic or other means, duplication of any material in this paper for a fee or for commercial purposes, or modification of the content of the paper are prohibited.

Rights Holder

Society of Photo-Optical Instrumentation Engineers

Click button above to open, or right-click to save.

Included in

Engineering Commons