arrow
返回

On the static assignment to parallel servers

delete1999-01-01
delete9
PRE
AI
G
Ger Koole *
DOI:10.1109/9.780430delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
The authors study the static assignment to M parallel, exponential, heterogeneous servers. Blocked customers are lost, while the objective is to minimize the average number of blocked customers. The problem is formulated as a stochastic control problem with partial observation, and an equivalent full observation problem is formulated. Numerical experiments are conducted and the structure of the optimal policies is studied.
Keyword:
dynamic programming
partially observed Markov decision processes
regular sequences
round robin
static assignments
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

IEEE Transactions on Automatic Control 封面图
IEEE Transactions on Automatic Control
IF:
7
论文数:
1.3W
被引数:
6.7W

机构

暂无机构信息
引用论文

引用论文

没有更多内容