Allocation of flows in closed bipartite queueing networks
From MaRDI portal
Publication:323531
DOI10.1016/j.ejor.2016.05.017zbMath1346.90242OpenAlexW2396219975MaRDI QIDQ323531
David J. Mendonça, Koushik Kar, James D. Brooks
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.05.017
Queues and service in operations research (90B22) Deterministic network models in operations research (90B10)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximizing throughput in finite-source parallel queue systems
- Dynamic routing in large-scale service systems with heterogeneous servers
- Optimal dynamic routing in flexible manufacturing systems with limited buffers
- Resource allocation in state-dependent emergency evacuation networks
- To queue or not to queue: equilibrium behavior in queueing systems.
- Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling
- Optimal pricing for service facilities with self-optimizing customers
- Critical thresholds for dynamic routing in queueing networks
- Uniqueness of the solution for optimal static routing in open BCMP queueing networks
- Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks
- On the severity of Braess's paradox: designing networks for selfish users is hard
- A Jackson network model and threshold policy for joint optimization of energy and delay in multi-hop wireless networks
- A note on the convexity of performance measures of M/M/c queueing systems
- The convexity of the mean queue size of the M/M/c queue with respect to the traffic intensity
- Self-Interested Routing in Queueing Networks
- Analyzing Computer System Performance with Perl::PDQ
- Dynamic Routing in a Queueing System with a Multiple Service Facility
- Optimal control of a queueing system with two heterogeneous servers
- Price-Directed Control of a Closed Logistics Queueing Network
- Optimal Design of Queueing Systems
- Individual versus Social Optimization in the Allocation of Customers to Alternative Servers
- Open and Closed Models for Networks of Queues
- Comparison of Policies for Routing Customers to Parallel Queueing Systems
- A vertex-allocation theorem for resources in queuing networks
- Mean-Value Analysis of Closed Multichain Queuing Networks
- Optimal routing for closed queueing networks
- Optimal Workload Allocation in Open Networks of Multiserver Queues
- Optimal balancing of I/O requests to disks
- Optimality of the shortest line discipline
- Optimality of the round-robin routing policy
- Bounding the mean response time of the minimum expected delay routing policy: an algorithmic approach
- Optimal static customer routing in a closed queuing network
- Choosing a Good Appointment System—A Study of Queues of the Type (D, M, 1)
- The Regulation of Queue Size by Levying Tolls
- Computational algorithms for closed queueing networks with exponential servers
- The price of anarchy is independent of the network topology
- Optimal Routing in Closed Queueing Networks with State Dependent Queues
