The generation of a set of optimal or near-optimal disassembly sequences is an important task associated with the study of disassembly planning. This task encapsulates actions at the required disassembly depth to reach maximum net revenue while satisfying economic constraints. The Petri net modelling, combined with heuristic search procedures developed in this study, offers an efficient procedure for disassembly sequence generation. The heuristic generates and searches a partial reachability graph to arrive at an optimal or near-optimal disassembly sequence based on the firing sequence of transitions of the Petri net model. The proposed methodology reduces the search space in two areas: (1) pruning the disassembly tree (DT) and, (2) selective tracking of the reachability graph. The efficacy of the proposed methodology is demonstrated by using two examples from the literature.
Disassembly sequence generation: A Petri net based heuristic approach
Reprints and Corporate Permissions
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
To request a reprint or corporate permissions for this article, please click on the relevant link below:
Academic Permissions
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
Obtain permissions instantly via Rightslink by clicking on the button below:
If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.
Related Research Data
Related research
People also read lists articles that other readers of this article have read.
Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.
Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.