Disassembly sequence planning is an essential issue for end-of-life (EOL) product recycling. Wide diffusion of consumer goods and shortening of product life-cycle have caused an increasing quantity of used products being discarded. The most evident effect is that landfill capacity is being used up. This revolves that a systematic technology in recycling is imperative. This paper developed a graph based heuristic approach for the product recycling. The model is embedded on a graph representation which is obtained by generating disassembly sequences. With graph representation, the problem of identifying the disassembly sequence planning is transformed into a graph search problem. By solving the graph search problem, one can determine the termination of disassembly and generate the disassembly sequence. The disposition of end-of-life product is becoming very important issues recently. The proposed graph-based approach is to find the feasible disassembly sequences from the CAD system directly and automatically. The benefit is to provide some useful information for the designer to evaluate the disassembly problem during the design stage.
|Number of pages||12|
|State||Published - 1997|
|Event||Proceedings of the 1997 21st IEEE/CPMT International Electronics Manufacturing Technology (IEMT) Symposium - Austin, TX, USA|
Duration: Oct 13 1997 → Oct 15 1997
|Conference||Proceedings of the 1997 21st IEEE/CPMT International Electronics Manufacturing Technology (IEMT) Symposium|
|City||Austin, TX, USA|
|Period||10/13/97 → 10/15/97|