关键词: 缓存区容量配置, 分支定界算法, 排队网, 装配单元, 随机批量物料运输系统

Abstract: To analyze the buffer allocation problem of assembly manufacturing system with random bulk transportation process,by taking the minimum investment cost as the objective,a buffer allocation optimal model that considered the cost of WIP and vehicle was established.Based on queuing network,a solving model for system performance was established,and the changing of system performance characteristic with the change of buffer was analyzed.According to the monotone characteristic of system performance,a branch and bound optimization method was put forward by using compressing upper and lower bounds.Several cases were solved with the proposed method,and the calculated performance results were compared with simulation to analyze the influence of buffer allocation results on performance index.

Key words: buffer allocation problem, branch and bound algorithm, queuing network, assembly unit, random bulk material handling systems