.png){kind=icon}
Return
Solving stochastic multi-manned U-shaped assembly line balancing problem using differential evolution algorithm
.png){kind=icon}
OA
AI
DOI：10.4995/ijpme.2021.16084.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The U-shaped assembly lines help to have more flexibility than the straight assembly lines, where the operators can perform tasks in both sides of the line, the entrance and the exit sides. Having more than one operator in any station of the line can reduce the line length and thereby affects the number of produced products. This paper combines the U-shaped assembly line balancing problem with the multi-manned assembly line balancing problem in one problem. In addition, the processing times of the tasks are considered as stochastic, where they are represented as random variables with known means and variances. The problem is formulated as a mixed-integer linear programming and the cycle time constraints are formulated as chance-constraints. The proposed algorithm for solving the problem is a differential evolution algorithm. The parameter of the algorithm is optimized using experimental design and the computational results are done on 71 adapted problems selected from well-known benchmarks.
Journal
No journal information available
Organization
No organization information available
Cited Papers
No cited papers available