A heuristic rule for routing customers to parallel servers

DOI10.1111/1467-9574.00040zbMath0890.60085OpenAlexW2093155901MaRDI QIDQ4354872

Simone Annetta Everdina Sassen, R. D. Nobel, Henk C. Tijms

Publication date: 17 September 1997

Published in: Statistica Neerlandica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/1467-9574.00040

zbMATH Keywords

decomposition approachcontrolled queuesMarkov decision algorithm

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (11)

Resource allocation and routing in parallel multi-server queues with abandonments for cloud profit maximization ⋮ On the Control of a Queueing System with Aging State Information ⋮ Size- and state-aware dispatching problem with queue-specific job sizes ⋮ A conservative index heuristic for routing problems with multiple heterogeneous service facilities ⋮ AN MDP DECOMPOSITION APPROACH FOR TRAFFIC CONTROL AT ISOLATED SIGNALIZED INTERSECTIONS ⋮ On the Value Function of the M/G/1 FCFS and LCFS Queues ⋮ DYNAMIC ROUTING POLICIES FOR MULTISKILL CALL CENTERS ⋮ DYNAMIC ROUTING OF CUSTOMERS WITH GENERAL DELAY COSTS IN A MULTISERVER QUEUING SYSTEM ⋮ Dispatching to parallel servers. Solutions of Poisson's equation for first-policy improvement ⋮ On the value function of the M/Cox(r)/1 queue ⋮ A nonparametric predictive method for queues

This page was built for publication: A heuristic rule for routing customers to parallel servers