A simple policy for multiple queues with size-independent service times

被引：1

作者：

Liu, Yuhang ^{[1
]}

Wang, Zizhuo ^{[1
]}

机构：

[1] Univ Minnesota, Minneapolis, MN 55455 USA

来源：

OPERATIONS RESEARCH LETTERS | 2013年 / 41卷 / 05期

关键词：

Queueing systems; State-independent policy; Batch service systems; INFINITE-CAPACITY SHUTTLE; MU-C-RULE; COMPETING QUEUES; LINEAR COSTS; REQUIREMENTS;

D O I：

10.1016/j.orl.2013.07.001

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

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. (C) 2013 Elsevier B.V. All rights reserved.

引用

页码：535 / 539

页数：5

共 14 条

[1]

[Anonymous], 1981, Introduction to Queueing Theory

[2] K COMPETING QUEUES WITH GEOMETRIC SERVICE REQUIREMENTS AND LINEAR COSTS - THE MU-C-RULE IS ALWAYS OPTIMAL [J].