.png){kind=icon}
返回
Maximizing throughput in finite-source parallel queue systems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2011.09.041.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Motivated by the dispatching of trucks to shovels in surface mines, we study optimal routing in a Markovian finite-source, multi-server queueing system with heterogeneous servers, each with a separate queue. We formulate the problem of routing customers to servers to maximize the system throughput as a Markov Decision Process. When the servers are homogeneous, we demonstrate that the Shortest Queue policy is optimal, and when the servers are heterogeneous, we partially characterize the optimal policy and present a near-optimal and simple-to-implement policy. We use the model to illustrate the substantial benefits of pooling, by comparing it to the permanent assignment of customers to servers. (C) 2011 Elsevier B.V. All rights reserved.
Keyword:
Markov processes
Queueing
Routing to parallel queues
Dispatching systems
Markov decision processes
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
Gaining a Sense of Touch Object Stiffness Estimation Using a Soft Gripper and Neural Networks.png)
Electronics
OAAI
ElectronicsIF0
OAAI分享收藏Differences in the mode of regulation of ornithine decarboxylase activity in undifferentiated versus differentiated mouse N‐18 neuroblastoma cellsFEBS Letters
OAAI
FEBS LettersIF0
OAAI分享收藏
查看更多内容