Optimal control of a single server in a finite-population queueing network
Optimal control of a single server in a finite-population queueing network
复制标题
DOI：
10.1007/s11134-016-9507-9
复制
发表时间：
2016-11
期刊：
影响因子：
1.2
通讯作者：
N. T. Argon;Chao Deng;V. Kulkarni
中科院分区：
文献类型：
--
作者：
N. T. Argon;Chao Deng;V. Kulkarni
研究了有限种群排队网络中单个服务器到多个服务站的最优动态分配问题。目标是最大化长期平均回报/吞吐量。我们使用样本路径比较，以确定条件下的网络结构和服务时间分布的最优策略是一个索引的政策。这个索引策略将服务器分配到非空的工作站，在那里完成一个作业所需的时间最短（在某种随机意义上）。例如，在多个并行站的网络中，如果服务时间可以按似然比排序，则最优策略将最高优先级分配给最快的站。最后，通过数值研究，我们测试了最短的预期服务时间的政策，并与三个站的并联串联网络，发现这个指数的政策，要么符合最优政策或提供了一个接近最优的性能。
We study the optimal dynamic assignment of a single server to multiple stations in a finite-population queueing network. The objective is to maximize the long-run average reward/throughput. We use sample-path comparisons to identify conditions on the network structure and service time distributions under which the optimal policy is an index policy. This index policy assigns the server to the non-empty station where it takes the shortest amount of time (in some stochastic sense) to complete a job. For example, in a network of multiple parallel stations, the optimal policy assigns the highest priority to the fastest station if service times can be ordered in likelihood ratios. Finally, by means of a numerical study, we test the shortest-expected-remaining-service-time policy on parallel-series networks with three stations and find that this index policy either coincides with the optimal policy or provides a near-optimal performance.