Optimal disassembly configurations for single and multiple products (original) (raw)
Related papers
Design for Product-Embedded Disassembly with Maximum Profit
2005 4th International Symposium on Environmentally Conscious Design and Inverse Manufacturing, 2005
This paper describes an extension of a method for designing products with built-in disassembly means developed in our previous work, as applied to a realistic example of a desktop computer assembly. Given component geometries and revenues, the method simultaneously determines, through an optimization process, the spatial configuration of component, locator and fasteners such that the product can be most economically disassembled via a domino-like "selfdisassembly" process triggered by the removal of one or a few fasteners. A multi-objective genetic algorithm is utilized to search for Pareto-optimal designs in terms of four objectives: 1) satisfaction of the distance specification among components, 2) efficient use of locators on components, 3) profit of overall disassembly process, and 4) mass fraction of retrieved components. The method is applied to a simplified model of Power Mac G4 cube®, and the results inspired a modification to the current design that can improve the ease of disassembly.
Generating a complete disassembly-to-order plan
IFAC International Workshop on Intelligent Assembly and Disassembly, 2007, 2007
We introduce techniques used to generate a complete disassembly-to-order (DTO) plan. DTO is a system where a variety of returned products are disassembled to fulfill the demand for specified numbers of components and materials. Complete DTO plan includes the optimal number of take-back products which maximize profit and minimize costs of the DTO system, the number of products to be sent through each disassembly station (non-destructive, destructive and mixed disassembly) including the type of disassembly to be performed (viz., complete or selective) and the optimal disassembly sequence of each product type to help minimize the complexities and the total disassembly time. Techniques implemented to solve the problem are Genetic Algorithm, Linear Physical Programming and refining algorithm. In this paper, we describe how these techniques can be combined to solve for a complete DTO plan. A numerical example is considered to illustrate the methodology.
2010
Environmental protection legislation, consumer interest in "green" products, a trend toward corporate responsibility and recognition of the potential profitability of salvaging operations, has resulted in increased interest in product take back. However, the cost effectiveness of product take-back operations is hampered by many factors, including the high cost of disassembly and a widely varying feedstock of dissimilar products. Two types of decisions must be made, how to carry out the disassembly process in the most efficient manner to "mine" the value-added that is still embedded in the product, and then how to best utilize that value-added once it is recovered. This paper presents a method for making those decisions. The concept of a transition matrix is integrated with mixed integer linear programming to determine the extent to which products should be disassembled and simultaneously determine the optimal end-of-life (EOL) strategy for each resultant component or subassembly. The main contribution of this paper is the simultaneous consideration of selective disassembly, multiple products, and the value added that remains in each component or subassembly. Shared disassembly operations and capacity limits are considered. An example using two cell phone products illustrates application of the model. The obtained results demonstrate the most economical level of disassembly for each cell phone and the best EOL options for each resultant module. In addition, the cell phone example shows that sharing disassembly operations between different products makes disassembly more cost effective compared with the case in which each product is disassembled separately.
2006
In this paper, we consider the disassembly-to-order (DTO) problem, where a variety of returned products are disassembled to fulfill the demand for specified numbers of components and materials. The objective is to determine the optimal numbers of returned products to disassemble so as to maximize profit and minimize costs. We model the DTO problem using a multi-criteria decision-making approach. Since the conditions of returned products are unknown, the yields from disassembly are considered to be stochastic. To solve the stochastic problem, we use one of the two heuristic approaches (viz., one-to-one approach or one-to-many approach) that converts the problem into a deterministic equivalent. We compare the performance of the two heuristic approaches using a case example.
Modeling and optimization for disassembly planning
2011
For the past two decades, increased efforts by both governments and the general public have been enforced through stricter legislations and more awareness to make manufacturing more environmentally conscious. Product refurbishing and component re-use are being applied on a wider scale worldwide. Disassembly, hence, has attracted more attention both in academia and the industry. Concepts and methods for disassembly planning should be further developed to support this new manufacturing environment. A semi-generative macro disassembly process planning approach based on the Traveling Salesperson formulation has been developed and is reported in this paper. Precedence graphs, which depict the precedence relationships between disassembly operations, are being utilized. The problem of generating optimal macro-level process plans is combinatorial in nature and proven NP-hard. Hence, a random-based hill-climbing heuristic based on Simulated Annealing is tailored for this problem. Finally, a ...
Heuristics for demand-driven disassembly planning
Computers & Operations Research, 2007
Remanufacturing of used products has become accepted as an advantageous disposition option within the field of reverse logistics. Remanufacturing, where a firm takes returned products at the end of their life and disassembles them to obtain parts which are reassembled into ...
Process planning for product disassembly
International Journal of Production Research, 2002
A disassembly plan is described by a disassembly bill of materials (DBOM), the sequence of processing steps, the type of disassembly action, the part or fastener worked on each step, the tools used, and the resulting material and part outputs. The disassembly process planning problem (DP3) involves the generation of a feasible plan and its implementation at a disassembly facility. In this paper, we introduce and describe the DP3 model. This model includes a structured format for creating, documenting, and evaluating a disassembly process plan. The resulting plan is intended to be a readily implemented solution and hence can be adopted by any reclamation facility. A key utility of this model is that it provides a format for transmitting product knowledge from the original product manufacturer to the consumer and the end-of-life disassembler, via the disassembly bill of materials (DBOM). The DP3 is a descriptive model, in that it describes a plan that can be readily developed by a manufacturer and e ciently distributed to the disassembly community. It is left to the user though, to determine the sequence of disassembly steps. The model introduces a variety of standards for identifying unfastening actions, destructive actions, and the required tools. The DP3 model also provides an economic evaluation of di erent plans.
Multi-Objective Optimization of Lot Size Balancing for Multi-Products Selective Disassembly
Lecture Notes in Economics and Mathematical Systems, 2001
This paper presents a mixed integer goal-programming model that provides a solution for planning component recovery from products with component commonality. The objective of the component recovery model is to determine the aggregate number of a variety of products to disassemble in order to economically fulfill the demand of a multitude of components, and yet have an environmentally benign policy of minimizing waste generation. A numerical example is presented to illustrate the methodology.
A method for dealing with multi-objective optimization problem of disassembly processes
Assembly and Task Planning, …, 2003
is highly manual. In this paper the authors consider the line structure and propose an algorithm which will allow to find a disassembly sequence that optimizes a very simplefirnction integrating the income from the parts, the materialproduced by theprocess and the cycle time of the disassembly line. An example is given to illustrate the proposed algorithm.
Disassembly sequence planning for products with defective parts in product recovery
Computers & Industrial Engineering, 1998
Recycling and remanufacturing are important forms of product/material recovery which involve product disassembly to retrieve the desired parts and/or subassemblies. Disassembly is a systematic method for separating a product into its constituent parts, components or other groupings. Efficient disassembly requires development of disassembly sequence plans (DSPs). Generating DSPs describing the sequence of parts during disassembly is not a trivial problem since DSP generation is described to be NP-complete. Further complicating matters is the presence of a high degree of uncertainty due to upgrading/downgrading of the product during its use by the customers and defects occurring either when in use or during disassembly. In this paper, we address the uncertainty related difficulties in disassembly sequence planning. To this end, we present a methodology to develop a framework for dealing with uncertainty in DSP implementation and demonstrate it using a simple example.