TY - JOUR
T1 - A simple policy for multiple queues with size-independent service times
AU - Liu, Yuhang
AU - Wang, Zizhuo
PY - 2013/8/8
Y1 - 2013/8/8
N2 - 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.
AB - 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.
KW - Batch service systems
KW - Queueing systems
KW - State-independent policy
UR - http://www.scopus.com/inward/record.url?scp=84881003435&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84881003435&partnerID=8YFLogxK
U2 - 10.1016/j.orl.2013.07.001
DO - 10.1016/j.orl.2013.07.001
M3 - Article
AN - SCOPUS:84881003435
SN - 0167-6377
VL - 41
SP - 535
EP - 539
JO - Operations Research Letters
JF - Operations Research Letters
IS - 5
ER -