.png){kind=icon}
返回
A new method for solving buffer allocation problem in large unbalanced production lines
.png){kind=icon}
PRE
AI
DOI：10.1080/00207543.2019.1685709.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Solving the buffer allocation problem (BAP) in long production lines is difficult because it is an NP-hard problem. In this paper, we propose a new approach to solve the BAP for long series-parallel unbalanced production lines with the objective of minimising the average work-in-process subject to a throughput rate constraint. Instead of directly optimising a long line, this method decomposes the original long line into several small decoupled subsystems and adds relation condition variables between the subsystems. After several iterations between subsystem optimisation and condition updating, this method can obtain the optimal or near-optimal solution of the original system with a significantly improved computational efficiency. Extensive numerical experiments demonstrate the accuracy and efficiency of this approach. Finally, several examples and a multi-factorial experimental analysis are provided to show the influence of the decomposition strategy, initial values, and parameters of the target systems on the performance of the proposed method.
Keyword:
buffer allocation problem
series-parallel production lines
unbalanced lines
decomposition-coordination
unsaturated supply
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分享收藏A parallel tabu search for solving the primal buffer allocation problem in serial production systemsOAAI
OAAI分享收藏分享收藏
查看更多内容