System performance analysis of flexible flow shop with match processing constraint
System performance analysis of flexible flow shop with match processing constraint
复制标题
具有匹配加工约束的柔性流水车间系统性能分析
DOI：
10.1080/00207543.2016.1166286
复制
发表时间：
2016
影响因子：
9.2
通讯作者：
Mao Ning
中科院分区：
文献类型：
--
作者：
Zhang Hui-Yu;Chen Qing-Xin;Mao Ning
Blocking makes the analytical modelling of open queuing networks with finite buffers intractable because the product-form solutions are unavailable. In this paper, about mould manufacturing, a four-stage flexible flow shop with match processing constraint is first modelled as an open queuing network with finite buffers. According to the characteristics of the matching node, the inter-arrival time distributions of parts arriving at the nodes are assumed to be exponential or general. Next, based on approximation of queuing theory, the Decomposition of State Space Method and the Generalized Expansion Method are developed for system performance evaluation. Then, experiments to assess the accuracy of the proposed methods are reported by comparing the analytical results with simulations. Finally, a case of a real-life production system of mould manufacturing is studied to show the application of the proposed methods. The results of experiments reveal that the proposed methods are feasible and effective for system performance evaluation and they can even solve large-size practical problems in a reasonable time. The results in this paper can provide a basis for system design or resource planning, to solve buffer allocation problems and capacity configuration problems.
