Abstract
We generate a disassembly PN (DPN) from a disassembly precedence matrix. 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. Since generating the reachability tree is NP-complete, we develop a heuristic algorithm to limit the size of the reachability tree. The algorithm employs multihypothesis search to dynamically explore the v likeliest lowest cost branches of the tree, in order to identify near-optimal DPPs. The cost function incorporates tool changes, changes in direction movement, and individual part characteristics (e.g., hazardous). An example is used to illustrate the procedure.
Keywords
Disassembly Process Planning, Environmentally Conscious Manufacturing (EnviCoM)
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
Permanent URL
Recommended Citation
Moore, Kendra E.; Gungor, Askiner; and Gupta, Surendra M., "Disassembly process planning using petri nets" (1998). Mechanical and Industrial Engineering Faculty Publications. Paper 26. http://hdl.handle.net/2047/d20000308
Click button above to open, or right-click to save.
COinS
Notes
Originally published in the Proceedings of the 1998 IEEE International Symposium on Electronics and the Environment, Oak Brook, IL, May 4-6, 1998 (CD-ROM)