Integrated approach for disassembly processes generation and recycling evaluation of an end-of-life product

An integrated approach for noble recycling is presented that puts forward the functional value of products and components. In a first step, the approach determines all feasible automatic disassembly sequences and in a second step all applicable recycling activities. This allows one to determine the most appropriate recycling process for an end-of-life product considering concurrent recycling techniques. The feasible automatic disassembly sequences are established by simulation in a virtual environment. The required generic disassembly product model, as well as the generic disassembly activity model, is presented by means of static and dynamic object-oriented diagrams. The recycling evaluation establishes an efficient solution responding to economic and ecological decision criteria. It is calculated applying a Goal-Programming approach transforming the multi-objective linear problem into a monocriteria linear program. The techno-economic decision model applied is Linear Activity Analysis. It allows one to integrate the generated disassembly processes based on single disassembly activities as well as other recycling techniques.     

Mathematical model and solution algorithms for selective disassembly sequencing with multiple target components and sequence-dependent setups

This study considers selective disassembly sequencing under the sequential disassembly environment in which one component is obtained at each disassembly operation. The problem is to determine the sequence of disassembly operations to obtain multiple target components of a used or end-of-life product for the purpose of repair, reuse, remanufacturing, disposal, etc. In particular, we consider sequence-dependent setups in which setup costs depend on the disassembly operation just completed and on the operation to be processed. The problem is represented as a disassembly precedence graph and then a new integer programming model is suggested for the objective of minimising the total disassembly cost. After it is proved that the problem is NP-hard, we suggest two types of heuristics: (1) branch and fathoming algorithm for small-to-medium-sized instances; and (2) priority-rule-based algorithm for large-sized instances. A series of computational experiments, i.e., effectiveness of the new integer programming model and performances of the two heuristic types, were done on various test instances, and the results are reported. In addition, to show the applicability of the mathematical model and the solution algorithms, a case study is reported on an end-of-life electronic calculator.     

Disassembly sequencing: A survey

This paper is a survey of the presently available literature on disassembly sequencing, including the papers that are closely related to this topic. Disassembly theory is applied to complex products such as mechanical, electromechanical and electronic appliances. It is required for end-of-life processing and for maintenance and repair. Apart from these applications, disassembly is studied for supporting the analysis of assembly processes. Disassembly sequencing involves the search for all possible disassembly sequences and the selection of the optimum solution out of these. In each application, a slightly different approach can be observed, including level of detail, degrees of freedom, and the role of uncertainty. Disassembly sequencing also plays a major role in the modern design process and is an invaluable tool in concurrent engineering. Its connection with the more detailed or component level and the less detailed level or process level including logistics, is highlighted. This presentation of the state of the art is intended as a stimulus for further research in this interesting field.     

Disassembly line in product recovery

There are several situations in a product recovery environment where products may be disassembled for economical and regulatory reasons. The disassembly line is perhaps the most suitable setting for disassembly of large products (consisting of numerous components) as well as small products received in large quantities. This paper discusses the importance of a disassembly line in product recovery. The objective of the disassembly line is to utilize the available resources as efficiently as possible while meeting the demand for recovered parts. However, there are many complicating matters that need to be considered to create an efficient disassembly line. Our primary goal is to discuss these issues and provide a better understanding of the complications and their effects on the disassembly line. We also demonstrate how some important factors in disassembly can be accommodated to balance a paced disassembly line by modifying the existing concept of assembly line balancing. An example is presented to illustrate the approach.     

Eco-architecture analysis for end-of-life decision making

In order to improve ease of disassembly and recycling of a product at its retirement stage, it is essential to design a product architecture that allows for easy disassembly and recycling. In this paper, a novel concept of eco-architecture is introduced, and the eco-architecture analysis, a design approach supporting the end-of-life decision making process, is proposed. The eco-architecture is the product architecture described from the end-of-life (EOL) viewpoint, in which a product is represented as an assembly of end-of-life modules. Not only does it prescribe an EOL strategy, but it also gives information about the connections and arrangement among EOL modules. Therefore, understanding the eco-architecture is helpful in enhancing the disassembly and recycling capabilities of an architecture design. The proposed eco-architecture analysis supports architecture improvement; it helps designers to derive the most desirable eco-architecture which entails the optimal end-of-life strategy. It also facilitates the extraction of meaningful redesign guidelines which make it possible to improve an architecture in an efficient and effective manner.     

Automatic derivation of transition matrix for end-of-life decision making

Recently strengthened environmental regulations have obligated manufacturing companies to treat end-of-life (EOL) products both environmentally consciously and economically. EOL treatment begins with disassembling a product into recyclable or disposable sub-assemblies. Therefore, the economic value of an EOL product is largely a function of the plan for its disassembly: the means by which it is to be disassembled into smaller sub-assemblies, and the choice of sub-assemblies to be disassembled first. In order to make these decisions, a disassembly structure describing every possible sub-assembly division and its disassembly path from the original product has to be presented in a typical form. A widely used form of such a structure is a transition matrix. A transition matrix shows all feasible sub-assemblies and their disassembly hierarchy. Whereas it can be easily transformed into mathematical disassembly planning problem, the tedious work required for its generation limits its practical use. In this paper, we propose an algorithm for automatic derivation of a transition matrix. The proposed algorithm provides an efficient way to derive a transition matrix based on a product's architectural information, which includes the product's physical connections and the relative geometric locations between individual parts. The algorithm was validated in deriving a transition matrix of a car door-trim. Our algorithm can significantly expand the applicability of transition-matrix-based disassembly planning research.     

Analyzing the effects of inventory cost setting rules in a disassembly and recovery environment

In this study we consider a disassembly and recovery facility receiving end-of-life products and facing demand for a specific part that is disassembled from the product and then recovered. The disassembly and recovery operations can be either performed before hand, or upon customer arrival. In the latter case, a discount on the selling price is applied to compensate the customer for waiting for the completion of the disassembly and recovery operations. One of the difficulties faced in planning for such a system is the determination of the opportunity cost associated with carrying recovered parts inventory. The difficulty arises in seeking the value added to the part given the costs incurred for maintaining the product return, disassembly and recovery costs and revenue earned from the hulk, that is the remaining product after the disassembly of the part. The main objective of the study is to investigate the effect of different rules to determine this opportunity cost on the performance of the system. Six rules are considered in the study. The performance of the rules is assessed by a computational study under an approximate inventory control policy.     

Design of disassembly sequences using search strategies. Application of IDA* in state diagrams

The main aim of a disassembly process is to reuse components and reduce the negative impact it has on the environment. Reaching an efficient and effective sequence of disassembly has become one of the major concerns in this field. This article refers to the use of iterative deepening A* search (artificial intelligence), in the design of the disassembly sequence. This method is applied to the state diagrams, a simple representation of the different states in a disassembly sequence. This way, the design process gains efficiency by finding the final sequence in the first iteration; therefore removing the need to analyse all possible sequences, since the best possible sequence is known in the first iteration. The method can also be applied to mechanical, electromechanical and electronic appliances with the aim of obtaining components for reuse or final disposal. Experimental results demonstrate the applicability and effectiveness of the methodology.     

Applying data mining technique to disassembly sequence planning: a method to assess effective disassembly time of industrial products

Design for end-of-life and design for disassembly are enabling design strategies for the implementation of business models based on the circular economy paradigm. The paper presents a method for calculating the effective disassembly sequence and time for industrial products. Five steps support designers in defining liaisons and related properties and precedence among components with the aim to calculate the best disassembly sequence and time. The effective disassembly time is computed considering the actual conditions of a product and its components (e.g. deformation, rust and wear) using corrective factors. This aspect represents the main contribution to the state of the art in the field of design for disassembly. The corrective factors are derived from a specific data mining process, based on the observation of real de-manufacturing activities. The proposed approach has been used for calculating the disassembly times of target components in a washing machine and in a coffee machine. The case studies highlight the method reliability of both: definition of time-effective disassembly sequences and assessment of effective disassembly times. In particular, a comparison of experimental tests shows a maximum deviation of ?6% for the electric motor of the washing machine and ?3% for the water pump of the coffee machine.     

Selective disassembly sequencing with random operation times in parallel disassembly environment

Selective disassembly sequencing is the problem of determining the sequence of disassembly operations to extract one or more target components of a product. This study considers the problem with random operation times in the parallel disassembly environment in which one or more components can be removed at the same time by a single disassembly operation. After representing all possible disassembly sequences using the extended process graph, a stochastic integer programming model is developed for the objective of minimising the sum of disassembly and penalty costs, where the disassembly costs consist of sequence-dependent set-up and operation costs and the penalty cost is the expectation of the costs incurred when the total disassembly time exceeds a threshold value. A sample average approximation-based solution algorithm is proposed that incorporates an optimal algorithm to solve the sample average approximating problem under a given set of scenarios for disassembly operation times. The algorithm is illustrated with a hand-light case and a large-sized random instance, and the results are reported.     

Modelling and planning of the disassembly processes using an enhanced expert Petri net

A sound disassembly Petri net model for the effective planning of disassembly processes and tasks is outlined. Owing to the unmanageable complexity associated with modelling of the disassembly processes and tasks, it becomes essential to have a more powerful Petri net model developed by incorporating the concepts of expert system, knowledge representation techniques, etc. Disassembly task planning at high and low levels can easily be represented by proposed high- and low-level expert Petri net. An algorithmic approach is also suggested for evaluating the end-of-life values of a product. These values are used to determine an optimal disassembly sequence and it is incorporated in the expert disassembly Petri net. A proposed expert enhanced high-level coloured disassembly Petri net is empowered to express such details vividly. The application of the proposed expert enhanced high-level coloured disassembly Petri net model is demonstrated through the sample disassembly of a flashlight.     

Disassembly line design with multi-manned workstations: a novel heuristic optimisation approach

As the first and the most time consuming step of product recovery, disassembly is described as the systematic separation of constituent parts from end-of-life products through a series of operations. In this context, designing and balancing disassembly lines are critical in terms of the efficiency of product recovery. Recent research on disassembly line balancing (DLB) has focused on classical stations where only one worker is allocated. However, such a line results in larger space requirement and longer disassembly lead time. In this paper, disassembly line balancing problem (DLBP) with multi-manned stations is introduced to the relevant literature as a solution to overcome these disadvantages. A mixed integer linear programming (MILP) model and two novel framework heuristic algorithms are developed to minimise the number of workers and workstations. MILP model has been applied to a dishwasher disassembly system. The application results indicate the superiority of establishing multi-manned stations over classical disassembly system design with single-worker stations with shorter disassembly lead time (80.9%) and line length (60.2%). Moreover, the proposed heuristics have been compared on newly generated test problems (instances) for DLBP. The results validate that the heuristics provide acceptable solutions in a reasonable amount of time even for large-sized problems.     

An improved co-evolutionary algorithm for green manufacturing by integration of recovery option selection and disassembly planning for end-of-life products

There is a strong need for recovery decision-making for end-of-life (EOL) products to satisfy sustainable manufacturing requirements. This paper develops and tests a profit maximisation model by simultaneously integrating recovery option selection and disassembly planning. The proposed model considers the quality of EOL components. This paper utilises an integrated method of multi-target reverse recursion and partial topological sorting to generate a feasible EOL solution that also reduces the complexity of genetic constraints handling. In order to determine recovery options, disassembly level and disassembly sequence simultaneously, this paper develops an improved co-evolutionary algorithm (ICA) to search for an optimal EOL solution. The proposed algorithm adopts the evolutionary mechanism of localised interaction and endosymbiotic competition. Further, an advanced local search operator is introduced to improve convergence performance, and a global disturbance strategy is also suggested to prevent premature convergence. Finally, this paper conducts a series of computational experiments under various scenarios to validate the meta-heuristic integrated decision-making model proposed and the superiority of the developed ICA. The results show that the proposed approach offers a strong and flexible decision support tool for intelligent recovery management in a ubiquitous information environment. We discuss the theoretical and practical contributions of this paper and implications for future research.     

Partial disassembly sequencing considering acquired end-of-life product age distributions

Uncertainty management is a priority in remanufacturing operations due to uncertain end-of-life (EoL) product quality, quantity and return timing. Ignoring EoL product uncertainty can result in inefficient remanufacturing operations. In this work, an approach is developed that addresses the impact of EoL product quality uncertainty on partial disassembly sequences. Disassembly is performed on nearly all EoL products, yet it is vulnerable to uncertain EoL product quality, defined in this work as the remaining value of an EoL product compared to original equipment manufacturer standards. The developed approach converges to an optimal or near-optimal partial disassembly sequence provided that information regarding acquired EoL product age distributions is known and correlates to EoL product quality. A mathematical framework is introduced to evaluate disassembly sequences based on profit standard deviation and profit probability as well as the traditionally used expected profit. The approach is tested on an example case study to investigate the impact of uncertain quality on the optimal or near-optimal disassembly sequence, expected profit, profit standard deviation and profit probability.     

Dynamic behavioural model for assessing impact of regeneration actions on system availability: Application to weapon systems

Mastering system availability all along the system life cycle is now a critical issue with regards to systems engineering. It is more true for military systems which operate in a battle context. Indeed as they must act in a hostile environment, they can become unavailable due to failures of or damage to the system. In both cases, system regeneration is required to restore its availability. Many approaches based on system modelling have been developed to assess availability. However, very few of them take battlefield damage into account and relevant methods for the model development are missing. In this paper, a modelling method for architecture of weapon system of systems that supports regeneration engineering is proposed. On the one hand, this method relies on a unified failure/damage approach to extend acknowledged availability models. It allows to integrate failures, damages, as well as the possibility of regeneration, into operational availability assessment. Architectures are modelled as a set of operational functions, supported by components that belong to platform (system). Modelling atoms (i.e. elementary units of modelling) for both the architecture components and functions are defined, based on state-space formalism. Monte Carlo method is used to estimate availability through simulation. Availability of the architecture is defined on the basis of the possible states of the required functions for a mission. The states of a function directly depend on the state of the corresponding components (i.e. the components that support the function). Aggregation rules define the state of the function knowing the states of each component. Aggregation is defined by means of combinatorial equations of the component states. The modelling approach is supported by means of stochastic activity network for the models simulation. Results are analysed in terms of graphs of availability for mission's days. Thus, given the simulation results, it is possible to plan combat missions based on criteria such as the number of platforms to be involved given functions required for the mission or the mean of regeneration to be deployed given the possible threats. Further, the simulation will help towards the design of improved architecture of system of systems which could focus on the factors affecting the availability.     

An improved gravitational search algorithm for profit-oriented partial disassembly line balancing problem

Disassembly is indispensable to recycle and remanufacture end-of-life products, and a disassembly line-balancing problem (DLBP) is studied frequently. Recent research on disassembly lines has focused on a complete disassembly for optimising the balancing ability of lines. However, a partial disassembly process is widely applied in the current industry practice, which aims at reusing valuable components and maximising the profit (or minimising the cost). In this paper, we consider a profit-oriented partial disassembly line-balancing problem (PPDLBP), and a mathematical model of this problem is established, which is to achieve the maximisation of profit for dismantling a product in DLBP. The PPDLBP is NP-complete since DLBP is proven to be a NP-complete problem, which is usually handled by a metaheuristics. Therefore, a novel efficient approach based on gravitational search algorithm (GSA) is proposed to solve the PPDLBP. GSA is an optimisation technique that is inspired by the Newtonian gravity and the laws of motion. Also, two different scale cases are used to test on the proposed algorithm, and some comparisons with the CPLEX method, particle swarm optimisation, differential evolution and artificial bee colony algorithms are presented to demonstrate the excellence of the proposed approach.     

Dynamic disassembly planning for remanufacturing of multiple types of products

With the increased need for remanufacturing of end-of-life products, achieving economic efficiency in remanufacturing is urgently needed. The purpose of this study was to devise a cost-minimisation plan for disassembly and remanufacturing of end-of-life products returned by consumers. A returned end-of-life product is disassembled into remanufacturable parts, which are supposed to be used for new products after being remanufactured. Each end-of-life product is disassembled into parts at variable levels and through variable sequences as needed, taking into account not only disassembly but also manufacturing, remanufacturing, and holding inventory of remanufacturable parts. This study proposes a mixed integer linear programming (MILP) model for derivation of the optimal disassembly plan for each returned product, under deterministically known demand and return flows. For the purposes of an illustrative example, the proposed model was applied to the formulation of an optimal disassembly and remanufacturing plan of ‘fuser assembly’ of laser printers. The solution reveals that variable-level disassembly of products saves a significant remanufacturing cost compared with full disassembly.     

Economic evaluation of disassembly processes in remanufacturing systems

A model to deal with the disassembly processes in remanufacturing systems is presented with focus being on evaluating their economic consequences. More specifically, the model assists decisions such as to which degree and for the sake of which components should the returned items be disassembled. Consequently, using the economic values of recoverable items, the inventory holding costs of these items are obtained. This information is further used to determine the inventory control policy. To access such economic values, the above average cost approach is compared with the net present value method. The latter is often considered a more?‘correct’?way in remanufacturing systems from the viewpoint of inventory control. The results from the economic evaluation model are intended to aid companies in systematically evaluating current as well as projected remanufacturing systems.     

Scheduling algorithms for remanufacturing systems with parallel flow-shop-type reprocessing lines

This study considers a scheduling problem for remanufacturing systems in which end-of-life products are separated into their major components at a disassembly workstation, each of them is reprocessed at its dedicated flow-shop-type reprocessing line with serial workstations, and finally, the reprocessed components, together with new components if required, are reassembled into remanufactured products at a reassembly workstation. Among various system configurations, we focus on the one with parallel flow-shop-type reprocessing lines since it is a typical remanufacturing configuration. The problem is to determine the sequence of products to be disassembled, the sequence of components to be reprocessed at each workstation of flow-shop-type reprocessing lines and the sequence of products to be reassembled for the objective of minimising the total flow time. An integer programming model is developed to represent the problem mathematically, and then, three types of heuristics, i.e. priority rule-based heuristic, Nawaz–Enscore–Ham-based heuristic and iterated greedy algorithm, are proposed due to the problem complexity. To show the performances of the heuristics, a series of computational experiments were done on various test instances, and the results are reported.     

Functional characterisation of mechanical joints to facilitate its selection during the design of open architecture products

New trends in product design require the use of modularity as key feature aimed to improve functional performance and the generation of open architecture products. For mechanical systems, one of the challenges during early design stages of these products involves the proper selection of joining methods among their constructive components. A robust joint selection process must consider product requirements, life cycle analysis and eventual procedures for assembly and disassembly. However, the general approach towards a Design-for-Assembly (DFA)/Design-for-Disassembly (DFD) only considers design, manufacturing and in some cases final disposal stage. Additionally, most of the works found in the literature are merely focused on assembly operations, disregarding economic and environmental benefits from optimising disassembly complexity. Herein, a functional characterisation of mechanical joint methods for the assembly and disassembly activities that take place throughout the product life cycle is proposed, focusing on open architecture products. Additionally, a classification of joining methods, a joint complexity metric valuation and a selection process are proposed for the conceptual design stage. The approach integrates both DFA and DFD principles in a formal methodology. The proposed selection roadmap can be implemented to increase product sustainability positively regarding resources optimisation, operational time and costs in reuse, remanufacturing and recycling tasks.