In: International Journal of Advanced Manufacturing Technology, Volume 20 Issue 8 (2002), pages 621-630. October 2002.
Abstract: The representation of the disassembly sequence is a key issue in maintenance planning. It involves a highly constrained combinatory problem, which is coupled with varying start and end nodes. These start and end nodes are dependent upon the nature of a maintenance task. In this paper, different representation and modelling schemes for disassembly sequence planning are first reviewed. Then, a novel representation scheme for disassembly sequence, which is generic and can be used to represent both the geometrical and precedence constraints dynamically in product disassembly, is proposed. Based on such a representation scheme, the process for the determination of possible disassembly sequences can be simplified. By taking into consideration disassembly constraints, the optimal disassembly sequence in relation to the component to be maintained (target component) can be quickly derived. This is achieved by pruning the search space of disassembly sequences, grouping related components into subassemblies, and identifying free components to facilitate disassembly oper-ations. Subsequently, the optimal disassembly sequence in relation to the target component can be obtained using genetic algorithms. In this manner, the disassembly sequences for a complex product comprising a relatively large number of components can be derived within a short time. A case study is used to illustrate the effectiveness of the representation scheme. Comparisons are made using the same case study with the AND/OR graph representation and the Petri net approach for disassembly sequence planning. The results show that the proposed representation scheme is simpler and is more efficient than the rest.
Keywords: Disassembly constraints; Disassembly sequence planning; Maintenance.