Topological arrangements of M/G/c/K, M/G/c/c queues in transportation and material handling systems

详细信息	查看全文 | 推荐本文 |

• 作者：Prince Bedell^a ; J. MacGregor Smith^b ; ^{jmsmith@ecs.umass.edu}
• 关键词：Topological network design ; Material handling systems
• 刊名：Computers and Operations Research
• 出版年：2012
• 期刊代码：3_03050548
• 类别：dec
• 出版时间：November, 2012
• 卷：39
• 期：11
• 页码：2800-2819
• 文件大小：1338 K

摘要

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 . Extensive computational results are included to test the properties of these network models to changes in service times, buffers, and other MHS network parameters.