Generalised ‘join the shortest queue’ policies for the dynamic routing of jobs to multi-class queues
From MaRDI portal
Publication:4678238
DOI10.1057/PALGRAVE.JORS.2601504zbMath1088.90017OpenAlexW2052654251MaRDI QIDQ4678238
No author found.
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
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)
Related Items (7)
Dynamic routing to heterogeneous collections of unreliable servers ⋮ A conservative index heuristic for routing problems with multiple heterogeneous service facilities ⋮ An approximate dynamic programing approach to the development of heuristics for the scheduling of impatient jobs in a clearing system ⋮ On the Value Function of the M/G/1 FCFS and LCFS Queues ⋮ Tax problems in the undiscounted case ⋮ Dynamic Distribution of Patients to Medical Facilities in the Aftermath of a Disaster ⋮ Whittle indexability in egalitarian processor sharing systems
This page was built for publication: Generalised ‘join the shortest queue’ policies for the dynamic routing of jobs to multi-class queues
