Optimal disassembly sequencing strategy using constraint programming approach

Abstract

PurposeThe purpose of this paper is to propose a framework to identify all the feasible disassembly sequences for a multi‐component product and to find an optimal disassembly sequence, according to specific criteria such as cost, duration, profit, etc.Design/methodology/approachTaking into account topological and geometrical constraints of a product structure, an AND/OR disassembly graph is built. Each graph node represents a feasible subassembly. Two nodes i and j are connected by an arc (i, j), called a transition, if the subassembly j can be obtained from the subassembly i by removing one or several connectors. Constraint programming approach is used to generate the feasible subassemblies and related transitions.FindingsIf a cost zij is incurred to perform a transition (i, j), an optimal disassembly sequence can be generated for a given subassembly, using the shortest path algorithm or a linear programming model.Research limitations/implicationsThe proposed approach performs very well compared to other approaches published in the literature, even when applied to products requiring parallel disassembly and including a large number of parts.Practical implicationsThis approach has been successfully applied to assess the wheelchair maintainability at the design stage and will be implemented in CAD systems. One other application, regarding the disassembly process and total revenue maximization for product recycling, is now under consideration.Originality/valueApplying constraint programming to efficiently generate the set of the feasible subassemblies constitutes the main contribution in this paper. This process is the hardest step in the disassembly sequencing problem.

A novel selective parallel disassembly planning method for green design

“…The methods by Zwingmann et al (2008), Tian et al (2009), and Wang and Zhang (2011) use AND/OR graphs and constraint programming, Petri nets and network searching algorithms, or structured models and rules to group parts together and remove multiple parts at the same time. However, the methods are not selective disassembly planning methods.…”

Mathematical model for the minimization of the mean disassembly time of a mechanical system at design stage

“…The system is designed for 10,000 hours mission duration. Table 1 shows the matrix of the 21 system's transitions obtained by applying the disassembly algorithm presented in [9]. Table 2 presents the possible sequences of transitions for disassembling each component.…”

“…The two children sub-assemblies are disjoint, that's means, they have no common component, and their gathering will give the parent assembly. Using a disassembly algorithm provides in [9], all feasible transitions, based on the system CAD model, are determined. Other disassembly models are also available in the literature, for example in [10] and [11].…”

An Optimization-Based Embodiment Design Approach for Mechatronic Product Development

“…One of the definitions of concurrent engineering, which stresses the importance of downstream activities in the process of design and development [19] "Concurrent or simultaneous engineering is the study of factors associated with the life cycle of the product during the design phase. These factors include product functionality, manufacture, assembly, testing, maintenance, reliability [20], dismantling [21], safety [22]." This description is supplemented by other authors stressing the parallelization of activities within the design and development processes [23] and interaction of business actors [24].…”