...
首页> 外文期刊>Mathematical Problems in Engineering: Theory, Methods and Applications >A dynamic programming algorithm for the bufferallocation problem in homogeneous asymptotically reliable serial production lines
【24h】

A dynamic programming algorithm for the bufferallocation problem in homogeneous asymptotically reliable serial production lines

机译:齐次渐近可靠的连续生产线缓冲分配问题的动态规划算法。

获取原文
           

摘要

In this study, the buffer allocation problem (BAP) inhomogeneous, asymptotically reliable serial production lines isconsidered. A known aggregation method, given by Lim, Meerkov, andTop (1990), for the performance evaluation (i.e., estimation ofthroughput) of this type of production lines when the bufferallocation is known, is used as an evaluative method inconjunction with a newly developed dynamic programming (DP)algorithm for the BAP. The proposed algorithm is applied toproduction lines where the number of machines is varyingfrom fourup to a hundred machines. The proposed algorithm is fast becauseit reduces the volume of computations by rejecting allocationsthat do not lead to maximization of the line's throughput.Numerical results are also given for large production lines.
机译:在这项研究中,考虑了不均匀,渐近可靠的串行生产线的缓冲区分配问题(BAP)。 Lim,Meerkov和Top(1990)给出了一种已知的聚合方法,用于在已知缓冲分配的情况下对这种类型的生产线进行性能评估(即,吞吐量估算),作为一种与新开发的动态方法结合使用的评估方法。 BAP的编程(DP)算法。所提出的算法应用于机器数量从四到一百台不等的生产线。所提出的算法是快速的,因为它通过拒绝不会导致生产线吞吐量最大化的分配减少了计算量。对于大型生产线,也给出了数值结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号