Optimization of Buffer-Size Allocation Using Dynamic Programming in Assembly-Like Systems

摘要

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.