Analysis of a finite-source customer assignment model with no state information

被引：4
|
作者：
Hordijk, A
Loeve, A
Tiggelman, J
机构：
[1] Leiden Univ, Dept Math & Comp Sci, NL-2333 CA Leiden, Netherlands
[2] Consul Risk Management BV, NL-2625 GZ Delft, Netherlands
来源：
MATHEMATICAL METHODS OF OPERATIONS RESEARCH | 1998年 / 47卷 / 02期
关键词：
static customer routing; algorithm; closed queueing network;
D O I：
10.1007/BF01194403
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
In this paper we analyse a closed queueing network in which customers have to be assigned to parallel queues. The routing decision may not depend on the numbers of customers in the queues. We present an algorithm and we show that it computes an average optimal policy in case of exponential service times. The algorithm also works for non-exponential service times, in which case periodic policies ale found.
引用
收藏
页码：317 / 336
页数：20
相关论文
共 50 条
12345