Product disassembly scheduling using graph models

Disassembly problem is a current issue for industrial companies. Governments of different countries promote research in this field. This paper presents the following points. First a brief state of the art in disassembly planning. Next it exposes a solution for the disassembly problem of industrial products. It uses a combination between direct and indirect graph representation for the product. all components whose have physical entity are considered as vertices of the graph. Edges of the graph represents the relationships between vertices. There are three different types of edges. First corresponds with accessibility and fasteners restrictions. Second corresponds with direct relations between components without fasteners. Last one corresponds with contact relationships, whose represent an indifferent chooses of the vertices. Based on that representation the paper exposed a method to find the best sequence to disassemble a component. Costs of disassembly each component and of changing tool between each pair of vertices and different sequences of the disassembly are taken into consideration. This method consists in a function minimization defined in the graph domain. In the last point of the paper this method is test with a remote-control disassembly. This method gives a solution to the problem, if several solutions, with the same cost, exist then it gives all of then, and anyone of these disassemble sequences could be used to achieve to the target component.