Abstract

A disassembly process plan (DPP) is a sequence of disassembly tasks which begins with a product to be disassembled and terminates in a state where all the parts of interest are disconnected. Disassembly process planning is critical for minimizing the resources invested in disassembly and maximizing the level of automation of the disassembly process and the quality of the parts (or materials) recovered. In this paper, we propose an algorithm which automatically generates a disassembly PN (DPN) from a geometrically-based disassembly precedence matrix (DPM). This algorithm can be used to generate DPPs for products which contain simple AND, OR, complex AND/OR, and XOR relationships. The resulting DPN can be analyzed using the reachability tree method to generate all feasible disassembly process plans (DPPs), and cost functions can be used to determine the optimal DPP. An example is used to illustrate the procedure.

Notes

Originally published in the Proceedings of the 1998 IEEE International Conference on Systems, Man, and Cybernetics, La Jolla, CA, October 11-14 1998 (CD-ROM)

Keywords

Disassembly Process Planning, Disassembly Precedence Matrix

Disciplines

Industrial Engineering | Mechanical Engineering

Publisher

IEEE

Publication Date

1998

Rights Information

(c) 1998 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.

Rights Holder

IEEE

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

Share

COinS