EconPapers    
Economics at your fingertips  
 

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

P S Ansell, K D Glazebrook and C Kirkbride
Additional contact information
P S Ansell: Newcastle University, Newcastle upon Tyne
K D Glazebrook: University of Edinburgh
C Kirkbride: Newcastle University, Newcastle upon Tyne

Journal of the Operational Research Society, 2003, vol. 54, issue 4, 379-389

Abstract: Abstract 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.

Keywords: dynamic programming; heuristics; multi-class queues; routing; scheduling (search for similar items in EconPapers)
Date: 2003
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://link.springer.com/10.1057/palgrave.jors.2601504 Abstract (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pal:jorsoc:v:54:y:2003:i:4:d:10.1057_palgrave.jors.2601504

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274

DOI: 10.1057/palgrave.jors.2601504

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook

More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

 
Page updated 2025-03-19
Handle: RePEc:pal:jorsoc:v:54:y:2003:i:4:d:10.1057_palgrave.jors.2601504