Generalised ‘join the shortest queue’ policies for the dynamic routing of jobs to multi-class queues
Generalised ‘join the shortest queue’ policies for the dynamic routing of jobs to multi-class queues
复制标题
用于将作业动态路由到多类队列的通用“加入最短队列”策略
DOI：
--
复制
发表时间：
2003
影响因子：
3.6
通讯作者：
C. Kirkbride
中科院分区：
文献类型：
--
作者：
P. Ansell;K. Glazebrook;C. Kirkbride
工作或客户到达后，需要在几个不同站点中的一个站点提供的服务。相关的路由问题涉及如何以最佳方式将客户分配到站点。许多经典文献都是关于单一类别的客户从一系列同类车站寻求服务的问题。我们认为，许多当代应用领域都需要对路径问题进行分析，在这些问题中，许多类别的客户寻求在不同站点提供的服务。本文首次考虑了在这种复杂环境下的路由策略，它适当地考虑了每个服务站的拥塞程度。政策改进方法产生了一类简单而直观的政策。在一项数字研究中，这些政策在所有情况下都接近最优。
Jobs or customers arrive and require service that may be provided at one of several different stations. The associated routing problems concern how customers may be assigned to stations in an optimal manner. Much of the classical literature concerns a single class of customers seeking service from a collection of homogeneous stations. We argue that many contemporary application areas call for the analysis of routing problems in which many classes of customer seek service provided at a collection of diverse stations. This paper is the first to consider routing policies in such complex environments which take appropriate account of the degree of congestion at each service station. A simple and intuitive class of policies emerges from a policy improvement approach. In a numerical study, the policies were close to optimal in all cases.