| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1142663 | Operations Research Letters | 2013 | 5 Pages |
Abstract
We consider a service system with two Poisson arrival queues. A server chooses which queue to serve at each moment. Once a queue is served, all the customers will be served within a fixed amount of time. This model is useful in studying airport shuttling or certain online computing systems. We propose a simple yet optimal state-independent policy for this problem which is not only easy to implement, but also performs very well.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Yuhang Liu, Zizhuo Wang,