Generalised ‘join the shortest queue’ policies for the dynamic routing of jobs to multi-class queues

Ansell, P. S.; Glazebrook, K. D.; Kirkbride, Christopher

doi:10.1057/palgrave.jors.2601504

Cited by 22 publications

(39 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Such decisions can be static, as in the case of the Griffiths et al (2005) work on rostering of supplementary nurses for an intensive care unit and Ding and Glazebrook (2005) who study the problem of warranty outsourcing; or dynamic as in the case of Ansell et al (2003) who investigate the allocation of different job types among a choice of service stations taking into account the degree of congestion at each service station. Such work, whether static or dynamic, again requires estimates of current system parameters or forecasts of their future levels.…”

Section: Strategic Versus Operationalmentioning

confidence: 99%

“…Sometimes costs can be associated with service levels and resources, in which case the queueing results can perhaps feed into some optimizing algorithm, as is the assumption made by Ansell et al (2003). Alternatively, resources can be treated as a constraint with the objective to maximize service level, as is the case in much call centre rostering work, see for example Green et al (2007).…”

Section: Optimizing Versus Decision Supportingmentioning

confidence: 99%

See 1 more Smart Citation

Reflections on queue modelling from the last 50 years

Worthington

2009

Journal of the Operational Research Society

View full text Add to dashboard Cite

Queueing theory continues to be one of the most researched areas of operational research, and has generated numerous review papers over the years. The phrase 'queue modelling' is used in the title to indicate a more practical emphasis. This paper uses work taken predominantly from the last 50 years of pages of the Operational Research Quarterly and the Journal of the Operational Research Society to offer a commentary on attempts of operational researchers to tackle real queueing problems, and on research foci past and future. A new discipline of 'queue modelling' is proposed, drawing upon the combined strengths of analytic and simulation approaches with the responsibility to derive meaningful insights for managers.

show abstract

Section: Strategic Versus Operationalmentioning

confidence: 99%

Section: Optimizing Versus Decision Supportingmentioning

confidence: 99%

Reflections on queue modelling from the last 50 years

Worthington

2009

Journal of the Operational Research Society

View full text Add to dashboard Cite

show abstract

“…Therefore, the original warranty repair allocation problem reduces to the problem of routing items arriving according to two independent Poisson streams to several vendors where service is provided according to a predetermined priority policy. A generalized model of this situation is studied by Ansell et al [2] where the authors develop a dynamic routing heuristic by applying a single policy improvement step to an initial static policy (see also Krishnan [12] and Tijms [19] for this approach). They name the resulting indexbased heuristic "generalized join the shortest queue" policy.…”

Section: Generalized Join the Shortest Queue Policy (Gjsq)mentioning

confidence: 99%

“…They name the resulting indexbased heuristic "generalized join the shortest queue" policy. Structurally our problem is a special case of that studied by Ansell et al [2] except for a minor modification: in addition to holding cost, we also allow a station-dependent fixed cost per assignment. Our main contribution is the tractable closed-form expressions for relevant index function.…”

Section: Generalized Join the Shortest Queue Policy (Gjsq)mentioning

confidence: 99%

See 1 more Smart Citation

Dynamic routing of prioritized warranty repairs

Feng

Kulkarni

2007

Naval Research Logistics

View full text Add to dashboard Cite

Recent years have seen a strong trend toward outsourcing warranty repair services to outside vendors. In this article we consider the problem of dynamically routing warranty repairs to service vendors when warranties have priority levels. Each time an item under warranty fails, it is sent to one of the vendors for repair. Items covered by higher priority warranty receive higher priority in repair service. The manufacturer pays a fixed fee per repair and incurs a linear holding cost while an item is undergoing or waiting for repair. The objective is to minimize the manufacturer's long-run average cost. Because of the complexity of the problem, it is very unlikely that there exist tractable ways to find the optimal routing strategies. Therefore, we propose five heuristic routing procedures that are applicable to real-life problems. We evaluate the heuristics using simulation. The simulation results show that the index-based "generalized join the shortest queue" policy, which applies a single policy improvement step to an initial state-independent policy, performs the best among all five heuristics.

show abstract

Index policies for the routing of background jobs

Glazebrook

Kirkbride

2004

Naval Research Logistics

View full text Add to dashboard Cite

Arriving (generic) jobs may be processed at one of several service stations, but only when no other (dedicated) jobs are waiting there. We consider the problem of how to route these incoming background jobs to make best use of the spare service capacity available at the stations. We develop an approximative approach to Whittle's proposal for restless bandits to obtain an index policy for routing. The indices concerned are increasing and nonlinear in the station workload. A numerical study testifies to the strong performance of the index policies developed.

show abstract

Generalised ‘join the shortest queue’ policies for the dynamic routing of jobs to multi-class queues

Cited by 22 publications

References 13 publications

Reflections on queue modelling from the last 50 years

Reflections on queue modelling from the last 50 years

Dynamic routing of prioritized warranty repairs

Index policies for the routing of background jobs

Contact Info

Product

Resources

About