Profit-oriented disassembly-line balancing

As product and material recovery has gained importance, disassembly volumes have increased, justifying construction of disassembly lines similar to assembly lines. Recent research on disassembly lines has focused on complete disassembly. Unlike assembly, the current industry practice involves partial disassembly with profit-maximization or cost-minimization objectives. Another difference between assembly and disassembly is that disassembly involves additional precedence relations among tasks due to processing alternatives or physical restrictions. In this study, we define and solve the profit-oriented partial disassembly-line balancing problem. We first characterize different types of precedence relations in disassembly and propose a new representation scheme that encompasses all these types. We then develop the first mixed integer programming formulation for the partial disassembly-line balancing problem, which simultaneously determines (1) the parts whose demand is to be fulfilled to generate revenue, (2) the tasks that will release the selected parts under task and station costs, (3) the number of stations that will be opened, (4) the cycle time, and (5) the balance of the disassembly line, i.e. the feasible assignment of selected tasks to stations such that various types of precedence relations are satisfied. We propose a lower- and upper-bounding scheme based on linear programming relaxation of the formulation. Computational results show that our approach provides near optimal solutions for small problems and is capable of solving larger problems with up to 320 disassembly tasks in reasonable time.     

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.     

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.     

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.     

Methods for optimum and near optimum disassembly sequencing

This paper considers disassembly sequencing problems subjected to sequence dependent disassembly costs. In practice, the methods for dealing with such problems rely mainly on metaheuristic and heuristic methods, which intrinsically generate suboptimum solutions. Exact methods are NP-hard and therefore unsuitable to most of the practical problems. Nevertheless, it is useful to have exact methods available that can be applied in order to check, at least medium sized problems, to what extent the heuristically obtained solutions deviate from the optimum solution. The existing exact approaches, which are based on integer linear programming (ILP), become unmanageable, even for the cases of modest product complexity. To alleviate this problem to some extent, the iterative method that has been proposed by Lambert (2006) is applied here. This method is based on repeatedly solving a binary integer linear programming (BILP) problem instead of an ILP problem. The method appears to converge sufficiently quickly to be valuable for dealing with medium sized problems. We then use the iterative method for the validation of a new heuristic method that is also proposed in this paper. Finally, both the heuristic and the iterative BILP methods are implemented on a cellphone from practice consisting of 25 components that are represented, according to a set of precedence relationships, via a disassembly precedence graph.     

Subassembly identification based on grey clustering

Nowadays discarded electromechanical products are more and more common, and have done much harm to the ecological environment, human health and natural resources. In order to recycle discarded products effectively, it is necessary to disassemble them properly in an integrated consideration of economic returns and environmental protection. Therefore Disassembly Process Planning has become a key part in Environmentally Conscious Design. Because there may be a combination explosion when the disassembly process of a product with a large number of parts is planned, subassembly identification is often adopted to divide the product into some reasonable subassemblies. This paper uses a method of grey clustering based on grey system theory to perform subassembly identification. The clustered objects are part pairs with adjacency relation in a product, and the clustering indices consist of energy consumption of disassembly, disassembly time, disassemblable direction and diameter of part pair. The indices can be obtained by detailed estimate or direct input from a CAD system via secondary development. After five grey clusters are set up, their whitening weight functions are presented in detail. Several other key problems in subassembly identification based on grey clustering are also expounded, such as obtaining the nondimensional matrix of sample values, determining the weight of clustering index relative to grey cluster. A heat-sealing machine with 80 components is selected as an example to validate the method of subassembly identification based on grey clustering. The identification result of the example is feasible according to experiences, and at the same time it satisfies the requirement of Disassembly Process Planning.     

基于模糊推理的不确定环境下拆卸工艺规划

回收产品因磨损等原因其结构和质量会发生改变,拆卸序列规划存在不确定性,拆卸前很难确定产品最优拆卸序列。首先建立一个模糊拆卸Petri网模型表示产品可行拆卸序列和拆卸过程存在的不确定信息,为降低产品质量和拆卸能力的不确定性对拆卸序列优化的影响,建立一个自适应的模糊推理系统,利用模糊推理和反馈学习的方法对产品各拆卸步骤的成本进行预测,然后通过计算不同拆卸序列下拆卸的收益来得到产品最优拆卸序列,最后通过算例证明了方法的有效性。     

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 exact solution approach for disassembly line balancing problem under uncertainty of the task processing times

The purpose of this work is to efficiently design disassembly lines taking into account the uncertainty of task processing times. The main contribution of the paper is the development of a decision tool that allows decision-makers to choose the best disassembly alternative (process), for an End of Life product (EOL), and assign the corresponding disassembly tasks to the workstations of the line under precedence and cycle time constraints. Task times are assumed to be random variables with known normal probability distributions. The case of presence of hazardous parts is studied and cycle time constraints are to be jointly satisfied with at least a certain probability level, or service level, fixed by the decision-maker. An AND/OR graph is used to model the precedence relationships among tasks. The objective is to minimise the line cost composed of the workstation operation costs and additional costs of workstations handling hazardous parts of the EOL product. To deal with task time uncertainties, lower and upper-bounding schemes using second-order cone programming and approximations with convex piecewise linear functions are developed. The applicability of the proposed solution approach is shown by solving to optimality a set of disassembly problem instances (EOL industrial products) from the literature.     

Evaluation model and algorithm of product disassembly process with stochastic feature

Disassembly planning is considered as the optimization of disassembly sequences with the target of the shortest disassembly time, the lowest disassembly cost, and the minimum disassembly energy consumption. However, obsolete products suffer from the influence of a variety of uncertainties, the disassembly process of products has the strong uncertain feature. Traditionally, to account for this uncertainty, each removal operation or removal task is assumed to be an activity or event with certain probability, and the determination of the optimal path of a disassembly process is merely a probabilistic planning problem based on this assumption. In this article, based on the established stochastic disassembly network graph, combined with different disassembly decision-making criterion, typical stochastic models for disassembly time analysis are developed. In addition, a two-phase approach is proposed to solve the typical stochastic models. Initially, according to different removal probability density functions, disassembly probability density functions of feasible disassembly paths are determined by a time-domain method or frequency-domain method, and additionally, after the disassembly probability density functions have been obtained, the quantitative evaluation of a product disassembly process and stochastic optimization of feasible disassembly paths are realized by a numerical solution method. Finally, a numerical example is illustrated to test the proposed concepts and the effectiveness of the proposed approach.     

Modelling material separation processes in bulk recycling

Increasing environmental concerns about the disposal of mass produced products have resulted in efforts to recover value from components and materials before discarding such products. Methods include incineration, disassembly or de-manufacturing and bulk recycling. This paper investigates several cases of the problem of selecting the best sequence for recovery of materials by bulk recycling. A solution procedure for determining the optimal sequence for isolating all target materials present in a given batch based on dynamic programming is presented. A modification for targeting specific materials in a batch is discussed. Additional constraints arising from the operation of such facilities are also discussed. The general problem of target material identification is presented and a procedure for selecting a profitable target material mix, along with a numerical illustration, is documented. Finally, the integrated consideration of bulk recycling and disassembly for evaluating product disposal costs is presented.     

A bill of materials-based approach for end-of-life decision making in design for the environment

Re-use, recycling or remanufacturing of products and components are good alternatives for reducing the environmental problems resulting from the huge amounts of waste currently arriving at landfills. A new approach is proposed in this paper for enhancing these alternatives from the earliest stages of product design. Given the product structure (obtained from its bill of materials (BOM)) and the joining and geometrical relationships among the components (obtained from the three-dimensional, computer-aided design representation), a model is proposed that will determine the EOL (EOL) strategy, i.e. the depth of disassembly inside the structure and the final end (re-use, recycle, remanufacture or disposal) for each disassembled part leading to the highest profit. A scatter search (SS) metaheuristic is used to determine the disassembly cost at each level of the BOM. The model presents a number of major improvements with respect to previous research. It addresses the problems of simultaneously determining both the best EOL strategy and the disassembly sequence, as well as allowing removal of components not only over the two or three Cartesian axes and affording the possibility of modifying the encountered strategy in a further step so as to fulfil other business criteria (such as disassembly time, resources availability or maximum waste generation rate).     

Modelling and evaluating product end-of-life options

The paper focuses on the modelling and evaluating product end-of-life options, which is the problem of representing products and determining disassembly sequences with the objective of maximizing revenue. For the problem considered here, three algorithms were developed. The first is the algorithm to generate the product recovery graph semi-automatically for a given product liaison graph. Then, using the generated product recovery graph, another algorithm is developed to obtain optimal disassembly plans that maximize revenue. This algorithm is based on the backward calculation so that the hyperedges of the recovery graph are visited only once. Finally, to cope with uncertainties of the end-of-life products, a recovery graph questioning algorithm is suggested to find the margin of allowed revenue reduction of a given target edge that maintains the same optimal plan. Application of the three algorithms is illustrated using an example.     

An algorithm for optimising the servicing of products with constrained,multiple defects

The twin pillars of sustainable development are the conservation of natural resources and the management of waste. Waste is generated whenever a product is serviced or repaired, or when it is ultimately discarded at the end of its useful life. In order to manage such waste, the servicing options and costs must first be ascertained. This paper presents an algorithm for the generation of optimal disassembly and re-assembly sequences for the servicing of products with multiple defects, subject to constraints such as inaccessible components. The multiple service action (MSA) algorithm determines the minimum total servicing cost for a product network based on Floyd's Algorithm, a shortest path algorithm. Well-established shortest path algorithms, which compute the shortest route between any pair of nodes in a network, are unable to handle multiple defects. The product network is first constructed, depicting the components and subassemblies as nodes, and embodying in directed arcs, the labour, materials and tooling costs associated with disassembly and re-assembly, as well as the cost to repair, reuse, recycle or dispose the defective components. The MSA algorithm was tested on seven different product networks representing multiple defective components that can be serviced by different feasible routes. For each feasible service route, associated costs were computed. It was established that the algorithm was able to generate optimum disassembly and re-assembly routes for the servicing of products with multiple defects subject to constraints.     

Cyclic lot scheduling with sequence-dependent set-ups: a heuristic for disassembly processes

The importance of material and product recovery is steadily increasing, mainly due to customer expectations and take-back obligations. Disassembly is a major operation in material and product recovery, since returned products are often disassembled to separate materials and components. The paper considers the problem of scheduling several items on a single disassembly facility. It develops a cyclic lot-scheduling heuristic for disassembly processes with sequence- dependent set-ups, resulting in disassembly frequencies for the items. Additionally, the way the problem is formulated allows calculation of the profitable use of the facility. The disassembly frequencies and the profitable use of the facility are used to create a cyclic schedule.     

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.     

Reverse supply chain optimisation with disassembly line balancing

Due to responding environmental issues, conforming governmental legislations and providing economic benefits, there has been a growing interest in recycling activities through the supply chains. Reverse supply chain (RSC) optimisation problem has a great potential as an efficient tactic to achieve this goal. While disassembly, one of the main activities in RSC, enables reuse and recycling of products and prevents the overuse, disassembly line balancing problem involves determination of a line design in which used products are partially/completely disassembled to obtain available components. The aim of this study is to optimise a RSC, involving customers, collection/disassembly centres and plants, that minimises the transportation costs while balancing the disassembly lines, which minimises the total fixed costs of opened workstations, simultaneously. A non-linear mixed-integer programming model, which simultaneously determines: (i) optimal distribution between the facilities with minimum cost, (ii) the number of disassembly workstations that will be opened with minimum cost, (iii) the cycle time in each disassembly centre and (iv) optimal assignment of tasks to workstations, is developed. A numerical example is given to illustrate the applicability of the proposed model. Different scenarios have been conducted to show the effects of sensitivity analyses on the performance measures of the problem.     

Life cycle activity analysis: logistics and environmental policies for bottled water in Portugal

An innovative mathematical programming decision support model –Life Cycle Activity Analysis (LCAA)– is presented, integrating considerations of optimal allocations of resources and impacts upon the environment during the life cycle of products. LCAA is based on the classical formulation of activity analysis and on the life cycle assessment framework. The concept of linear activities is extended to embrace mass and energy fluxes over the entire life cycle of products including their environmental impacts. Special attention is given to the presence of loops in the product chains, such as those occurring when materials/products are recovered (reused, recycled.). An application brought from the Portuguese bottled water industry is described. The model features alternative activities for production technologies and product recovery strategies and permits the joint consideration of monetary costs and environmental burdens. The results obtained under five scenarios, including distinct disposal strategies and environmental constraints, are discussed.     

Effects of an Inaccurate Sorting Procedure on Optimal Procurement and Production Decisions in a Remanufacturing System

Under the uncertainty of market demand and quality of returns, sorting prior to disassembly is effective for timely obtaining information about the remanufacturability of used products. In this article, we assume that the remanufacturable fraction of used products is a random variable and introduce an inaccurate sorting procedure of used products prior to disassembly. Then, three two-stage optimization models are formulated to maximize the expected profits of a remanufacturer in a single period with used products and/or new parts as inputs to meet the stochastic market demand. Moreover, the article provides a case study to explore the optimal decisions under different scenarios and analyzes the effects of parameters, such as the unit disassembly cost, unit sorting cost, and proportion of sorting errors. Finally, the results indicate that whether remanufacturing with sorting is more profitable than that without sorting mainly depends on the sorting accuracy and the relative value between disassembly cost and sorting cost. When considering or not considering a long lead time of new parts, the effects of sorting errors on procurement policies are different. A long lead time will result in lower expected profits. Finally, the diverse types of classification errors have different influences on procurement policies and corresponding expected profit.     

Heuristic algorithms for minimising total recovery cost of end-of-life products under quality constraints

Recently, the optimisation of end-of-life (EOL) product recovery processes has been highlighted. At the inspection phase after disassembly, each part can have various recovery options such as reuse, reconditioning, remanufacturing, and disposal. Depending on the selected options of parts, the values of recovered products that are made by reassembling parts will be different. Hence, it is important to decide appropriate recovery options of parts at the treatment of EOL products, in order to maximise the values of recovered products. To this end, this study deals with a decision making problem to select the best recovery options of parts for minimising the total recovery cost of products under quality constraints. This problem is formulated with a mixed integer nonlinear programming model and heuristic search algorithms are proposed to resolve it. A case study for a turbocharger product is introduced with computational experiments of the proposed algorithms.