.png){kind=icon}
Return
A decomposition based solution algorithm for U-type assembly line balancing with interval data
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2015.01.010.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Balancing U-type assembly lines under uncertainty is addressed in this paper by formulating a robust problem and developing its optimization model and algorithm. U-type assembly layouts are shown to be more efficient than conventional straight lines. A great majority of studies on U-lines assume deterministic environments and ignore uncertainty in operation times. We aim to fill this research gap and, to the best of our knowledge, this study will be the first application of robust optimization to U-type assembly planning. We assume that the operation times are not fixed but they can vary. We employ robust optimization that considers worst case situations. To avoid over-pessimism, we consider that only a subset of operation times take their worst case values. To solve this problem, we suggest an iterative approximate solution algorithm. The efficiency of the algorithm is evaluated with some computational tests. (C) 2015 Elsevier Ltd. All rights reserved.
Keywords:
Assembly line balancing
Robust optimization
Combinatorial optimization
Benders decomposition
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
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveAssembly line balancing under uncertainty: Robust optimization models and exact solution method
PREAI
ShareSaveShareSaveAn optimal piecewise-linear program for the U-line balancing problem with stochastic task times
PREAI
ShareSaveShareSave
View more