.png){kind=icon}
返回
Dynamic Server Assignment With Task-Dependent Server Synergy
.png){kind=icon}
PRE
AI
DOI：10.1109/TAC.2014.2328951.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We study tandem queueing systems with finite buffers in which servers work more efficiently in teams than on their own and the synergy among collaborating servers can be task-dependent. Our goal is to determine the dynamic server assignment policy that maximizes the long-run average throughput. When each server works with the same ability at each task that she/he is assigned to, we show that any nonidling policy where all servers work in teams of two or more at all times is optimal. On the other hand, when the server abilities are task-dependent, we show that for Markovian systems with two stations and two servers, depending on the synergy among the servers, the optimal policy either assigns the two servers to different stations when possible, or lets them work in a team at all times. Finally, for larger Markovian systems, we provide sufficient conditions that guarantee that the optimal policy has all servers working together at all times.
Keyword:
Dynamic server assignment
finite buffers
flexible servers
Markov decision processes
tandem queues
throughput maximization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
引用论文
Critical Evaluation and Thermodynamic Optimization of the Li2O-Al2O3 and Li2O-MgO-Al2O3 Systems
PREAI
分享收藏
Synthesis of spiro-pyrazolines: reaction of 1,3-diphenylnitrilimine with fulvenes.png)
Tetrahedron
TetrahedronIF0
PREAI
分享收藏
分享收藏
查看更多内容