.png){kind=icon}
返回
Finite buffer polling models with routing
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2003.11.030.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper analyzes a finite buffer polling system with routing. Finite buffers are used to model the limited capacity of the system, and routing is used to represent the need for additional service. The most significant results of the analysis are the derivation of the generating function for queue length when buffer sizes are limited and a representation of the system workload. The queue lengths at polling instants are determined by solving a system of recursive equations; an embedded Markov chain analysis and numerical inversion are used to derive the queue length distributions. This system may be used to represent production models with setups and lost sales or expediting. (c) 2004 Elsevier B.V. All rights reserved.
Keyword:
queueing
polling
routing
setups
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
查看更多内容