Simultaneous buffer and service rate allocation in open finite queueing networks
研究开放有限排队网络中同时优化缓冲区分配和服务速率的非线性混合整数规划问题，提出结合排队网络分解与序列二次规划的分支定界方法，适用于串联、分流和合并拓扑网络。
Simultaneous buffer and service rate allocation in open finite queueing networks is a nonlinear mixed-integer programming problem that is -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.