Disassembly sequence generation: A Petri net based heuristic approach
From MaRDI portal
Publication:4707451
DOI10.1080/00207540210146116zbMath1038.90013MaRDI QIDQ4707451
No author found.
Publication date: 7 October 2003
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540210146116
90C59: Approximation methods and heuristics in mathematical programming
90B10: Deterministic network models in operations research
Related Items
A collaborative ant colony algorithm to stochastic mixed-model U-shaped disassembly line balancing and sequencing problem, Can large-scale disassembly be profitable? A linear programming approach to quantifying the turning point to make disassembly economically viable, An asynchronous parallel disassembly planning based on genetic algorithm
Cites Work
- Unnamed Item
- Unnamed Item
- Configuration analysis to support product redesign for end-of-life disassembly
- A review of synthesis techniques for Petri nets with applications to automated manufacturing systems
- Petri net models of flexible and automated manufacturing systems: a survey
- Optimal disassembly of complex products
- Economical evaluation of disassembly operations for recycling, remanufacturing and reuse
- Performability of automated manufacturing systems with centralized material handling
- Scheduling disassembly
- Planning product disassembly for material recovery opportunities
- Petri net approach to disassembly process planning for products with complex AND/OR precedence relationships
