.png){kind=icon}
返回
A fast algorithm for buffer allocation problem
.png){kind=icon}
PRE
AI
DOI：10.1080/00207543.2015.1092612.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we address the problem of seeking optimal buffer configurations in unreliable production lines with the objective of maximising their production rates. A fast algorithm is proposed for solving the problem. The key idea is to decompose a long production line into a set of overlapping three-machine two-buffer systems. The performance of the algorithm is demonstrated by a comparison with the degraded ceiling (DC) algorithm. Numerical results show that the proposed algorithm is almost as accurate as the DC algorithm, but it is much faster, especially for long production lines.
Keyword:
buffer allocation problem
optimisation
unreliable production lines
decomposition method
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.3
论文数:
1.1W
被引数:
3.7W
机构
引用论文
Exposure of Neonatal Mice to Tobacco Smoke Disturbs Synaptic Proteins and Spatial Learning and Memory from Late Infancy to Early Adulthood.png)
PLOS ONE
OAAI
PLOS ONEIF0
OAAI分享收藏
查看更多内容