Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Engineering
Disassembly Process Planning Using Petri Nets, Kendra E. Moore, Askiner Gungor, Surendra M. Gupta
Disassembly Process Planning Using Petri Nets, Kendra E. Moore, Askiner Gungor, Surendra M. Gupta
Surendra M. Gupta
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). …
Disassembly Petri Net Generation In The Presence Of Xor Precedence Relationships, K. E. Moore, Askiner Gungor, Surendra M. Gupta
Disassembly Petri Net Generation In The Presence Of Xor Precedence Relationships, K. E. Moore, Askiner Gungor, Surendra M. Gupta
Surendra M. Gupta
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 …