Two approaches for solving the buffer allocation problem in unreliable production lines
Two approaches for solving the buffer allocation problem in unreliable production lines
复制标题
解决不可靠生产线缓冲区分配问题的两种方法
DOI：
10.1016/j.cor.2013.02.004
复制
发表时间：
2013
期刊：
影响因子：
--
通讯作者：
A. Løkketangen
中科院分区：
文献类型：
--
作者：
Leyla Demir;S. Tunali;D. Eliiyi;A. Løkketangen
本文提出了一种综合的方法来解决不可靠生产线中的缓冲区分配问题，以使缓冲区总大小最小的生产线的吞吐量最大化。所提出的集成方法有两个控制回路：内环和外环。而内环控制包括Demir等人提出的自适应禁忌搜索算法。[8]对于外环，提出了二进制搜索和禁忌搜索。这些嵌套循环旨在最小化总缓冲区大小，以达到所需的吞吐量级别。为了提高禁忌搜索的效率，提出了替代的邻域生成机制。通过大量的计算实验对所提算法的性能进行了评估，并给出了测试结果。
This paper presents an integrated approach to solve the buffer allocation problem in unreliable production lines so as to maximize the throughput rate of the line with minimum total buffer size. The proposed integrated approach has two control loops; the inner loop and the outer loop. While the inner loop control includes an adaptive tabu search algorithm proposed by Demir et al. [8], binary search and tabu search are proposed for the outer loop. These nested loops aim at minimizing the total buffer size to achieve the desired throughput level. To improve the efficiency of the proposed tabu search, alternative neighborhood generation mechanisms are developed. The performances of the proposed algorithms are evaluated by extensive computational experimentation, and the results are reported.