Optimization of buffer-size allocation using dynamic programming in assembly-like systems
Optimization of buffer-size allocation using dynamic programming in assembly-like systems
复制标题
DOI：
--
复制
发表时间：
2010-10
期刊：
影响因子：
--
通讯作者：
Masayoshi Hasama;Yu Song;Takao Ito;S. Matsuno
中科院分区：
文献类型：
--
作者：
Masayoshi Hasama;Yu Song;Takao Ito;S. Matsuno
类装配排队系统用于化工生产线的装配过程以及计算机系统的数据流。虽然许多模型是在串联和合并系统中构建的，但众所周知，类装配系统更加复杂，难以分析。这些系统在排队理论中没有被研究。鉴于大多数研究都集中在简单的装配节点上，本文采用数值分析的动态规划方法进行评估，提出了缓冲区大小的最优分配算法。
Assembly-like queueing systems are used in the assembly processes in production lines in the chemical industry as well as dataflow in computer systems. While many models are constructed in tandem and merge systems, assembly-like systems are known to be more complicated and difficult to analyze. These systems are not investigated in queueing theory. Whereas most research focuses on simple assembly-nodes, in this paper, we evaluate by dynamic programming using numerical analysis to propose buffer-size optimal allocation algorithm.