Optimal server allocation in closed finite queueing networks
Optimal server allocation in closed finite queueing networks
复制标题
DOI：
10.1007/s10696-014-9202-2
复制
发表时间：
2014-09
影响因子：
2.7
通讯作者：
J. Smith;Ryan Barnes
中科院分区：
文献类型：
--
作者：
J. Smith;Ryan Barnes
制造和服务系统中的许多拓扑网络设计问题可以用封闭的网络、有限的缓冲区和多服务器来建模。由于其完整性，很难预测这些问题的性能，更不用说优化其参数。本文提出了一种新的队列分解方法，用于建模这些有限缓冲区的多个服务器沿着与网络拓扑结构中的服务器的优化分配的综合方法的封闭排队网络。的性能和优化算法进行了描述，并进行了大量的实验，为系列，合并，和分裂的拓扑结构，以及材料处理和布局系统的集成。
Many topological network design problems in manufacturing and service systems can be modelled with closed queueing networks, finite buffers, and multiple-servers. Because of their integrality, it is difficult to predict the performance of these problems, let alone optimize their parameters. This paper presents a new queue decomposition approach for the modelling of these finite buffer closed queueing networks with multiple servers along with an integrated approach to the optimization of the allocation of the servers in the network topology. The performance and optimization algorithms are described and a number of experiments for series, merge, and split topologies together with the integration of material handling and layout systems are carried out.