Individually optimal routing in parallel systems
From MaRDI portal
Recommendations
- Socially and Individually Optimal Routing of Stochastic Jobs in Parallel Processor Systems
- Optimality of routing and servicing in dependent parallel processing systems
- On the Assignment of Customers to Parallel Queues
- Optimal routing to parallel heterogeneous servers-small arrival rates
- scientific article; zbMATH DE number 4059093
Cited in
(19)- Socially and Individually Optimal Routing of Stochastic Jobs in Parallel Processor Systems
- Optimal routing to two parallel heterogeneous servers with resequencing
- Scheduling jobs on heterogeneous processors
- Monotonicity properties of user equilibrium policies for parallel batch systems
- Managing Queues with Heterogeneous Servers
- A Parallel Routing Algorithm for Traffic Optimization
- User-Optimal State-Dependent Routeing in Parallel Tandem Queues with Loss
- Stochastically Minimizing Total Delay of Jobs Subject to Random Deadlines
- scientific article; zbMATH DE number 431652 (Why is no real title available?)
- Influencing waiting lists
- User equilibria for a parallel queueing system with state dependent routing
- Job scheduling to minimize expected weighted flowtime on uniform processors
- Heavy Traffic queues with heterogeneous servers:pathwise average cost per unit time problem
- Nearly optimal control of queues in heavy traffic with heterogeneous servers
- Characteristics of deterministic optimal routing for two heterogeneous parallel servers
- Mathematical theory of queueing networks
- AN INDIVIDUAL AND SOCIALLY OPTIMAL POLICY MINIMIZING EXPECTED FLOW TIMES
- Efficient Parallel Routing Algorithms for Cartesian and Composition Networks
- Optimizing Routing and Backlogs for Job Flows in a Distributed Computing Environment
This page was built for publication: Individually optimal routing in parallel systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3696272)
