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

DOI10.1057/PALGRAVE.JORS.2601504zbMath1088.90018OpenAlexW2052654251MaRDI QIDQ4678237

S. Apeland, Philip A. Scarf

Publication date: 23 May 2005

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601504

zbMATH Keywords

heuristicsschedulingdynamic programmingroutingmulti-class queues

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Queues and service in operations research (90B22) Dynamic programming (90C39)

This page was built for publication: Generalised ‘join the shortest queue’ policies for the dynamic routing of jobs to multi-class queues