首页> 外文期刊>Mathematical Problems in Engineering: Theory, Methods and Applications >A DYNAMIC PROGRAMMING ALGORITHM FOR THE BUFFER ALLOCATION PROBLEM IN HOMOGENEOUS ASYMPTOTICALLY RELIABLE SERIAL PRODUCTION LINES
【24h】

A DYNAMIC PROGRAMMING ALGORITHM FOR THE BUFFER ALLOCATION PROBLEM IN HOMOGENEOUS ASYMPTOTICALLY RELIABLE SERIAL PRODUCTION LINES

机译:A DYNAMIC PROGRAMMING ALGORITHM FOR THE BUFFER ALLOCATION PROBLEM IN HOMOGENEOUS ASYMPTOTICALLY RELIABLE SERIAL PRODUCTION LINES

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

摘要

In this study, the buffer allocation problem (BAP) in homogeneous, asymptotically reliable serial production lines is considered. A known aggregation method, given by Lim, Meerkov, and Top (1990), for the performance evaluation (i.e., estimation of throughput) of this type of production lines when the buffer allocation is known, is used as an evaluative method in conjunction with a newly developed dynamic programming (DP) algorithm for the BAP. The proposed algorithm is applied to production lines where the number of machines is varying from four up to a hundred machines. The proposed algorithm is fast because it reduces the volume of computations by rejecting allocations that do not lead to maximization of the line's throughput. Numerical results are also given for large production lines.

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号