Bottleneck Determination in Networks of Queues
Bottleneck Determination in Networks of Queues
复制标题
队列网络中的瓶颈确定
DOI：
--
复制
发表时间：
1982
期刊：
影响因子：
--
通讯作者：
P. Schweitzer
中科院分区：
文献类型：
--
作者：
P. Schweitzer
程序给出了在开放网络的队列，或封闭网络的队列与客户人口接近无穷大的饱和服务器。前者导致同时的功能方程的吞吐量，而后者导致一个非线性互补问题，在重要的特殊情况下，可以解释为一个库恩-塔克集。有效的计算程序提供了开放和封闭的网络情况。
Procedures are given for identifying saturated servers in open networks of queues, or closed networks of queues with customer populations approaching infinity. The former leads to simultaneous functional equations for the throughputs, while the latter leads to a non-linear complementarity problem which in important special cases may be interpreted as a Kuhn-Tucker set. Efficient computational procedures are supplied for both the open and closed network cases.