Profit-oriented disassembly-line balancing (original) (raw)
Related papers
2-OPT Heuristic for the Disassembly Line Balancing Problem
SPIE Proceedings, 2004
Disassembly activities are an important part of product recovery operations. The disassembly line is the best choice for automated disassembly of returned products. However, finding the optimal balance for a disassembly line is computationally intensive with exhaustive search quickly becoming prohibitively large. In this paper, a greedy algorithm is presented for obtaining optimal or near-optimal solutions to the disassembly line-balancing problem. The greedy algorithm is a first-fit decreasing algorithm further enhanced to preserve precedence relationships. The algorithm seeks to minimize the number of workstations while addressing hazardous and high demand components. A two optimal algorithm is then developed to balance the part removal sequence and attempt to further reduce the total number of workstations. Examples are considered to illustrate the methodology. The conclusions drawn from the study include the consistent generation of optimal or near-optimal solutions, the ability to preserve precedence, the speed of the algorithms and their practicality due to the ease of implementation.
Greedy algorithm for disassembly line scheduling
SMC'03 Conference Proceedings. 2003 IEEE International Conference on Systems, Man and Cybernetics. Conference Theme - System Security and Assurance (Cat. No.03CH37483)
Remanufacturing, recycling, and disposal recovery operations require the performance of disassembly activities. The disassembly line is the best choice for automated disassembly of returned products, however, finding the optimal balance is computationally intensive with exhaustive search quickly becoming prohibitively large. In this paper, a greedy algorithm is presented for obtaining optimal or near-optimal solutions to the disassembly line balancing problem. The greedy algorithm is a first-fit decreasing algorithm further enhanced to preserve precedence relationships. The algorithm seeks to minimize the number of workstations while accounting for hazardous and high demand components. A hill-climbing heuristic is then developed to balance the part removal sequence. Examples are considered to illustrate the methodology. The conclusions drawn from the study include the consistent generation of optimal or near-optimal solutions, the ability to preserve precedence, the speed of the algorithm and its practicality due to the ease of implementation.
Planning and Balancing of Disassembly Systems
Legislative changes triggered by the exhaustion of natural resources have increased the importance of disassembly as a form of recycling. The implementation of computer-supported procedures in recycling has become indispensable. Time management data was used to develop a tool for the economic planning of disassembly processes, allowing for load balancing of disassembly systems with division of work.
IIE Transactions, 2009
In this paper, the disassembly line balancing problem, which involves determining a line design in which used products are completely disassembled to obtain useable components in a cost-effective manner, is studied. Because of the growing demand for a cleaner environment, this problem has become an important issue in reverse manufacturing. In this study, two exact formulations are developed that utilize an AND/OR Graph (AOG) as the main input to ensure the feasibility of the precedence relations among the tasks. It is also shown that traditional task precedence diagrams can be derived from the AOG of a given product structure. This procedure leads to considerably better solutions of the traditional assembly line balancing problems; it may alter the approach taken by previous researchers in this area.
Disassembly scheduling problem: literature review and future research directions
IFAC-PapersOnLine, 2019
This paper presents a literature review on disassembly scheduling problem, one of the important operational problems in disassembly systems. It can be generally defined as the problem of determining the timing and quantity of the end-of-life products while satisfying the demand of their parts/ sub-assemblies over a given planning horizon. First, we review the existing research papers on disassembly scheduling problem and analyze the different models and methods of resolution used to solve this problem. Then, the complexity of product structures is discussed. Finally, we suggest several future research directions. Further study is still needed to address the stochastic parameters, the limit on product return, extra capacity and the setup time in the disassembly scheduling problem.
Optimal disassembly configurations for single and multiple products
Journal of Manufacturing Systems, 1999
This paper considers the problem of determining optimal disassembly configurations for single and multiple products, that is, which assemblies and subassemblies to disassemble and which to leave intact. The paper first examines the problem of determining revenue-maximizing disassembly configurations for a single product using the hierarchical product tree representation, and develops a linear time algorithm for its solution. This algorithm is then extended to the case where fixed costs may be associated with disassembly o! some nodes in the product tree. Finally, the problem of meeting a specified demand for recovered components and subassemblies from an available inventory of recovered products, where disassembly capacity is limited and products may have common components, is formulated as an opti-. mization problem. A column-generation algorithm for this problem is presented that is capable of solving reasonably sized problems in a few seconds of CPU time on average.
Supply-driven rebalancing of disassembly lines: A novel mathematical model approach
Journal of Cleaner Production, 2019
In recent years, the interest of disassembly line has increased owing to the economic reasons and increase of environmental awareness. The balancing of the disassembly line is one of the factors affecting directly the performance of the process. Companies with a line used effectively can gain many advantages in terms of economic aspect and it facilitates competition the companies with others. Moreover, uncertainties end-of-life products characteristics and quantity of supply/demand causes reassigned of task and altering cycle time. Rebalancing of disassembly line is required in this situation. In this study, a novel mixed integer programming model is proposed. Firstly, disassembly line balance is created, and then according to the given new supply, tasks are reselected and reassigned to the workstations. A real case study is presented. The generated test problems are also analyzed using proposed mathematical model. Through the analysis of rebalancing the existing disassembly line, it has been identified that an existing balance might have been changed to accommodate changes in the desired output rate in order to cope up with the variation of the cycle time.
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.
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.
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 ...