Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/s11134-016-9507-9 | Queueing Syst. |
Keywords | Field | DocType |
Scheduling,Queueing networks,Likelihood ratio ordering,SEPT,68M20,60K25,90B22,90B36 | Population,Mathematical optimization,Optimal control,Computer science,Scheduling (computing),Real-time computing,Layered queueing network,Queueing theory,Throughput,Service time,Network structure | Journal |
Volume | Issue | ISSN |
85 | 1-2 | 0257-0130 |
Citations | PageRank | References |
1 | 0.38 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nilay Tanık Argon | 1 | 76 | 6.71 |
| Chao Deng | 2 | 1 | 0.38 |
| Vidyadhar G. Kulkarni | 3 | 539 | 60.15 |