.png){kind=icon}
.png){kind=icon}
Return
An optimal algorithm for selective disassembly sequencing with sequence-dependent set-ups in parallel disassembly environment
.png){kind=icon}
PRE
AI
DOI：10.1080/00207543.2017.1342879.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This study considers selective disassembly sequencing in parallel disassembly environment in which two or more components can be removed by a single disassembly operation. The problem is to determine the sequence of disassembly operations to extract multiple target components while satisfying the precedence relations among disassembly operations. The objective is to minimise the sum of sequence-dependent set-up and operation costs. An integer programming model is developed after representing all possible disassembly sequences using an extended process graph, and then an optimal branch and bound algorithm is proposed that incorporates the methods to obtain the lower and upper bounds as well as a dominance property to reduce the search space. To show the performance of the algorithm, computational experiments are done on various random instances, and the results are reported. In particular, it is shown from the test results that the optimal algorithm requires much shorter computation times than a competitive commercial software package. Finally, a case is reported to illustrate the extended process graph and the solution algorithm.
Keywords:
disassembly planning
parallel disassembly
selective disassembly sequencing
sequence-dependent set-ups
branch and bound
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.3
Papers:
1.1W
Citations:
3.7W