.png){kind=icon}
返回
Balancing stochastic U-lines using particle swarm optimization
.png){kind=icon}
PRE
AI
DOI：10.1007/s10845-016-1234-x.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
U-lines are important parts of the Just-In-Time production system in order to improve productivity and quality. In real life applications of assembly lines, the tasks may have varying execution times defined as a probability distribution. In this study, a novel particle swarm optimization algorithm is proposed to solve the U-line balancing problem with stochastic task times. A computational study is conducted to compare the performance of the proposed approach to the existing methods in the literature. The results of the computational study show that the proposed approach performs quite effectively. It also yields good solutions for all test problems within a short computational time.
Keyword:
Assembly line balancing
U-lines
Stochastic
Particle swarm optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.4
论文数:
3.5K
被引数:
1.1W
机构
引用论文
.png){kind=icon}
查看更多内容