Topological arrangements of M/G/c/K, M/G/c/c queues in transportation and material handling systems
Topological arrangements of M/G/c/K, M/G/c/c queues in transportation and material handling systems
复制标题
DOI：
10.1016/j.cor.2012.02.009
复制
发表时间：
2012-11-01
影响因子：
4.6
通讯作者：
Smith, J. MacGregor
中科院分区：
文献类型：
--
作者：
Bedell, Prince;Smith, J. MacGregor
具有一般服务时间的有限缓冲区单服务器排队以及状态相关的排队对于运输和物资处理系统(MHS)中的一般流程是稳健的。本文研究了多服务台和状态相关队列的集成以及这些排队网络模型的稳健性。文中还证明了有限排队网络中的拓扑安排问题是NP难的。包括大量的计算结果，以测试这些网络模型对服务时间、缓冲区和其他MHS网络参数变化的特性。(C)2012爱思唯尔有限公司。保留所有权利。
Finite buffer, single server queues with general service times along with state dependent queues were shown to be robust with respect to the general flow processes in transportation and material handling systems (MHS). This paper examines the integration of multi-server and state dependent queues and the robustness properties in these queueing network models. It is also shown that the topological arrangements problem (TAP) in a finite queueing network is NP-Hard. Extensive computational results are included to test the properties of these network models to changes in service times, buffers, and other MHS network parameters. (c) 2012 Elsevier Ltd. All rights reserved.