Pages that link to "Item:Q4354872"
From MaRDI portal
The following pages link to A heuristic rule for routing customers to parallel servers (Q4354872):
Displaying 17 items.
- Size- and state-aware dispatching problem with queue-specific job sizes (Q439382) (← links)
- Resource allocation and routing in parallel multi-server queues with abandonments for cloud profit maximization (Q1634077) (← links)
- A nonparametric predictive method for queues (Q1869480) (← links)
- Design heuristic for parallel many server systems (Q1991286) (← links)
- Dispatching to parallel servers. Solutions of Poisson's equation for first-policy improvement (Q2070675) (← links)
- A conservative index heuristic for routing problems with multiple heterogeneous service facilities (Q2216197) (← links)
- A simple heuristic for load balancing in parallel processing networks with highly variable service time distributions (Q2268467) (← links)
- To split or not to split: selecting the right server with batch arrivals (Q2450658) (← links)
- On the value function of the M/Cox(<i>r</i>)/1 queue (Q3410920) (← links)
- On the Control of a Queueing System with Aging State Information (Q3458138) (← links)
- AN MDP DECOMPOSITION APPROACH FOR TRAFFIC CONTROL AT ISOLATED SIGNALIZED INTERSECTIONS (Q3541003) (← links)
- DYNAMIC ROUTING POLICIES FOR MULTISKILL CALL CENTERS (Q3612037) (← links)
- DYNAMIC ROUTING OF CUSTOMERS WITH GENERAL DELAY COSTS IN A MULTISERVER QUEUING SYSTEM (Q3645155) (← links)
- Customer routing to parallel servers with different rates (Q3700566) (← links)
- OPTIMAL SPLITTING OF RENEWAL INPUT PROCESS TO A QUEUEING SYSTEM AND ITS APPLICATION TO A NETWORK (Q3822972) (← links)
- Generalised ‘join the shortest queue’ policies for the dynamic routing of jobs to multi-class queues (Q4678237) (← links)
- On the Value Function of the M/G/1 FCFS and LCFS Queues (Q4903042) (← links)
