.png){kind=icon}
.png){kind=icon}
Return
Heuristic solution methods for the selective disassembly sequencing problem under sequence-dependent costs
.png){kind=icon}
OA
AI
DOI：10.1016/j.cor.2020.105151.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The first Waste Framework Directive issued by the European Union dates back to the seventies but was drastically amended in the last decade to reduce environmental impacts of waste by encouraging reuse, recycling and remanufacturing. Product recovery starts with disassembly which results in high labor costs. Disassembly supports environmentally conscious choices like replacement of defective parts to extend the life span of products, removal of suitable components for reuse and extraction of hazardous substances to decontaminate materials for reprocessing. Besides, selective disassembly also accommodates maintenance and repairs. Optimizing the cost of disassembly is crucial to make this process an economically viable option. Due to change tools and parts reorientation, disassembly costs are sequence-dependent. Therefore minimizing the disassembly cost involves the search for an adequate sequence of disassembly tasks. Consequently, this paper addresses the disassembly sequencing problem for selective and sequential disassembly under sequence-dependent costs. As optimal formulations fail to handle real-world cases, we develop a randomized greedy algorithm (needing a very few number of parameters to be set and proving to be robust with respect to their value) and a matheuristic to solve efficiently medium to large-sized instances. (C) 2020 Elsevier Ltd. All rights reserved.
Keywords:
Disassembly
Product recovery
Maintenance
Greedy algorithms
Matheuristics
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W