首页> 外文期刊>Computers & operations research >Queue decomposition & finite closed queueing network models
【24h】

Queue decomposition & finite closed queueing network models

机译:队列分解和有限封闭排队网络模型

获取原文
获取原文并翻译 | 示例

摘要

Closed, finite queueing networks are applicable to many different manufacturing and service system settings. The incorporation of material handling and transportation networks in finite buffer closed queueing networks is studied. A novel queue decomposition approach using state dependent queues to capture the buffer of finite M/M/1/K queues is shown to be a viable approach for modelling these systems. Each M/M/1/K queue is replaced with a coupled state dependent queue plus an M/M/1 queue. An extended mean value analysis (MVA) algorithm is employed to demonstrate the integration of the state dependent queues for the buffers in the approach. Under certain restrictions concerning the network population, finite queueing networks with the state dependent queues acting as buffers should have a product form distribution. This paper focuses on M/M/1/K queues and their transformation while future papers will treat the multi-server case. Several different closed series (i.e. cyclic), merge, and split topological systems of finite queues are analyzed and presented.
机译:封闭的有限排队网络适用于许多不同的制造和服务系统设置。研究了物料处理和运输网络在有限缓冲区封闭排队网络中的结合。一种新颖的使用状态依赖队列来捕获有限M / M / 1 / K队列缓冲区的队列分解方法被证明是对这些系统建模的可行方法。每个M / M / 1 / K队列都替换为依赖于状态的耦合队列加上M / M / 1队列。采用扩展的平均值分析(MVA)算法来演示该方法中缓冲区的状态相关队列的集成。在有关网络数量的某些限制下,以状态相关队列为缓冲区的有限排队网络应具有乘积形式分布。本文关注于M / M / 1 / K队列及其转换,而未来的论文将讨论多服务器情况。分析并提出了几种不同的闭合序列(即循环),合并和分裂的有限队列拓扑系统。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号