Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Disassembly sequence generation: A Petri net based heuristic approach

Disassembly sequence generation: A Petri net based heuristic approach 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Production Research Taylor & Francis

Disassembly sequence generation: A Petri net based heuristic approach

16 pages

Loading next page...
 
/lp/taylor-francis/disassembly-sequence-generation-a-petri-net-based-heuristic-approach-UDAYRhmvC0

References (36)

Publisher
Taylor & Francis
Copyright
Copyright Taylor & Francis Group, LLC
ISSN
1366-588X
eISSN
0020-7543
DOI
10.1080/00207540210146116
Publisher site
See Article on Publisher Site

Abstract

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.

Journal

International Journal of Production ResearchTaylor & Francis

Published: Jan 1, 2002

There are no references for this article.