Characteristics of deterministic optimal routing for two heterogeneous parallel servers
From MaRDI portal
Publication:5249290
DOI10.1142/S0129054101000862zbMATH Open1319.68042MaRDI QIDQ5249290FDOQ5249290
Authors:
Publication date: 30 April 2015
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Recommendations
- Optimal routing to parallel heterogeneous servers-small arrival rates
- Optimal routing of customers with general independent interarrival times in deterministic parallel queues
- Optimal routing to two parallel heterogeneous servers with resequencing
- Routing Jobs to Servers with Deterministic Service Times
- Optimal routing into two heterogeneous service stations with delayed information
Cites Work
- Individual versus Social Optimization in the Allocation of Customers to Alternative Servers
- The Regulation of Queue Size by Levying Tolls
- A simple dynamic routing problem
- On the optimal assignment of customers to parallel servers
- Comparison of Policies for Routing Customers to Parallel Queueing Systems
- Optimality of the shortest line discipline
- Deciding Which Queue to Join: Some Counterexamples
- Individually optimal routing in parallel systems
Cited In (7)
- Optimal Routing of Fixed Size Jobs to Two Parallel Servers
- Optimal routing to two parallel heterogeneous servers with resequencing
- A heuristic rule for routing customers to parallel servers
- A packet-size aware adaptive routing algorithm for parallel transmission server systems
- Analysis of job assignment with batch arrivals among heterogeneous servers
- Routing Jobs to Servers with Deterministic Service Times
- Optimal routing to parallel heterogeneous servers-small arrival rates
This page was built for publication: Characteristics of deterministic optimal routing for two heterogeneous parallel servers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5249290)
