Optimal control of a single server in a finite-population queueing network

详细信息    查看全文

• 作者：Nilay Tanık Argon ; Chao Deng ; Vidyadhar G. Kulkarni
• 关键词：Scheduling ; Queueing networks ; Likelihood ratio ordering ; SEPT
• 刊名：Queueing Systems
• 出版年：2017
• 出版时间：February 2017
• 年：2017
• 卷：85
• 期：1-2
• 页码：149-172
• 全文大小：
• 刊物类别：Business and Economics
• 刊物主题：Operation Research/Decision Theory; Computer Communication Networks; Probability Theory and Stochastic Processes; Supply Chain Management; Systems Theory, Control;
• 出版者：Springer US
• ISSN：1572-9443
• 卷排序：85

文摘

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.