首页> 外文期刊>Computers & operations research >Two approaches for solving the buffer allocation problem in unreliable production lines
【24h】

Two approaches for solving the buffer allocation problem in unreliable production lines

机译:解决不可靠生产线中缓冲区分配问题的两种方法

获取原文
获取原文并翻译 | 示例

摘要

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.
机译:本文提出了一种综合方法来解决不可靠生产线上的缓冲区分配问题,从而以最小的总缓冲区大小最大化生产线的吞吐率。所提出的集成方法具有两个控制回路。内循环和外循环。内环控制包括Demir等人提出的自适应禁忌搜索算法。 [8],针对外循环提出了二进制搜索和禁忌搜索。这些嵌套循环旨在最小化总缓冲区大小,以实现所需的吞吐量水平。为了提高提出的禁忌搜索的效率,开发了替代邻域生成机制。通过大量的计算实验评估了所提出算法的性能,并报告了结果。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号