队长不可观的两并行不同服务台路径最优策略

Optimal Routing of a Network of Two Parallel Heterogeneous Servers without Observations on Their Queue Lengths

本文研究各带有buffer的两并行不同服务台的路径问题,在队长信息不可观但已知两排队的初始分布相同的假设下,文中给出一种增广轮换性最优策略,即先指定m个顾客给服务率强的排队,再指定一个顾客给服务率弱的排队,如此重复下去。m是可计算的,且这种策略的最优性与顾客到达的统计特性无关。

In this paper we consider the routing problem of a network of two parallel heterogenous servers with individual buffers. If the queue lengths are not observed then the optimal policy is the extended “RR” rule. The optimality of the strategy is independent of the statistics of the job’s arrivals.