.png){kind=icon}
.png){kind=icon}
Return
A sample average approximation method for disassembly line balancing problem under uncertainty
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2014.05.006.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper considers a Disassembly Line Balancing Problem (DLBP) under uncertainty. Disassembly task times are assumed to be random variables with known probability distributions. To deal with this uncertainty, a stochastic program is developed. It both chooses the best disassembly alternative for an end of life product and assigns the corresponding disassembly tasks to the workstations of the line with the aim to minimize the line cost. The latter includes the operation costs for workstations as well as penalty costs generated by the cycle time constraint violations. AND/OR precedence constraints among tasks are observed. A proposed solution algorithm is capable of providing high quality solutions even for large scale problem instances. It integrates Monte Carlo sampling techniques with the L-shaped algorithm. (C) 2014 Elsevier Ltd. All rights reserved.
Keywords:
Sustainable manufacturing
Product recovery
Disassembly lines
Line design
Stochastic programming
L-shaped algorithm
Monte Carlo sampling
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