Simultaneous buffer and service rate allocation in open finite queueing networks
Simultaneous buffer and service rate allocation in open finite queueing networks
复制标题
DOI：
10.1080/24725854.2017.1300359
复制
发表时间：
2018-01-01
影响因子：
2.6
通讯作者：
Smith, James MacGregor
中科院分区：
文献类型：
--
作者：
Smith, James MacGregor
开放有限排队网络中的同时缓冲区和服务速率分配是一个 NP 困难的非线性混合整数规划问题。排队网络分解方法与非线性顺序二次规划算法相结合，通过分支定界方案针对各种网络拓扑计算同时最佳缓冲区分配和服务速率。结果表明，优化问题是一个非线性凸规划问题，有助于寻找局部最优解。还包括用于在网络节点之间转移有限客户群体的物料搬运或运输系统。大量的数值结果证明了该方法对于串联、分离和合并拓扑网络的有效性。检查服务速率和缓冲区的分配模式是否持续存在是这项工作的重点之一。
Simultaneous buffer and service rate allocation in open finite queueing networks is a nonlinear mixed-integer programming problem that is NP-Hard. A queueing network decomposition methodology is coupled with a nonlinear sequential quadratic programming algorithm to compute the simultaneous optimal buffer allocations and service rates via a branch-and-bound scheme for various network topologies. It is shown that the optimization problem is a nonlinear convex programming problem, which assists in the search for local optimal solutions. The material handling or transportation system for transferring the finite customer population between the nodes in the network is also included. Extensive numerical results demonstrate the efficacy of the methodology for series, split, and merge topology networks. Examination of the persistence or absence of the allocation patterns of the service rates and buffers is one of the focal points of this work.