A heuristic rule for routing customers to parallel servers
From MaRDI portal
Publication:4354872
DOI10.1111/1467-9574.00040zbMATH Open0890.60085OpenAlexW2093155901MaRDI QIDQ4354872FDOQ4354872
Authors: Simone Annetta Everdina Sassen, Henk Tijms, R. D. Nobel 
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
Recommendations
- Optimal Dynamic Assignment of Customers to Heterogeneous Servers in Parallel
- scientific article
- Optimal Routing of Customers to Two Parallel Heterogeneous Servers: The Case of IHR Service Times
- Customer routing to parallel servers with different rates
- Optimal routing to two parallel heterogeneous servers with resequencing
- Optimal routing to parallel heterogeneous servers-small arrival rates
- Optimal static distribution of prioritized customers to heterogeneous parallel servers
- Optimal Routing of Fixed Size Jobs to Two Parallel Servers
- Characteristics of deterministic optimal routing for two heterogeneous parallel servers
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)
Cited In (16)
- On the Control of a Queueing System with Aging State Information
- DYNAMIC ROUTING OF CUSTOMERS WITH GENERAL DELAY COSTS IN A MULTISERVER QUEUING SYSTEM
- Generalised ‘join the shortest queue’ policies for the dynamic routing of jobs to multi-class queues
- Resource allocation and routing in parallel multi-server queues with abandonments for cloud profit maximization
- DYNAMIC ROUTING POLICIES FOR MULTISKILL CALL CENTERS
- 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
- OPTIMAL SPLITTING OF RENEWAL INPUT PROCESS TO A QUEUEING SYSTEM AND ITS APPLICATION TO A NETWORK
- A simple heuristic for load balancing in parallel processing networks with highly variable service time distributions
- A nonparametric predictive method for queues
- ON A ROUTING PROBLEM
- On the value function of the M/G/1 FCFS and LCFS queues
- Customer routing to parallel servers with different rates
- Dispatching to parallel servers. Solutions of Poisson's equation for first-policy improvement
- On the value function of the M/Cox(r)/1 queue
This page was built for publication: A heuristic rule for routing customers to parallel servers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4354872)
