Optimal Routing in Closed Queueing Networks with State Dependent Queues
From MaRDI portal
Publication:6102716
DOI10.3138/infor.49.1.045OpenAlexW2014593561MaRDI QIDQ6102716
Publication date: 9 May 2023
Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3138/infor.49.1.045
Related Items (3)
The evaluation of pedestrians' behavior using \(M/G/C/C\) analytical, weighted distance and real distance simulation models ⋮ Allocation of flows in closed bipartite queueing networks ⋮ Queue decomposition \& finite closed queueing network models
Cites Work
- An \(M/G/C/C\) state-dependent network simulation model
- Dynamic routing in large-scale service systems with heterogeneous servers
- Optimal dynamic routing in flexible manufacturing systems with limited buffers
- Generalized concavity
- Generalized \(M/G/C/C\) state dependent queueing models and pedestrian traffic flows
- Combining routing and buffer allocation problems in series-parallel queueing networks
- Mean value analysis for multiclass closed queueing network models of flexible manufacturing systems with limited buffers
- Queue-and-Idleness-Ratio Controls in Many-Server Service Systems
- Comparison of Policies for Routing Customers to Parallel Queueing Systems
- Routing in circuit-switched networks: optimization, shadow prices and decentralization
- A vertex-allocation theorem for resources in queuing networks
- Mean-Value Analysis of Closed Multichain Queuing Networks
- Optimal routing for closed queueing networks
- Bounds on the Performance of Dynamic Routing Schemes for Highly Connected Networks
- Braess's paradox in a queueing network with state-dependent routing
- Braess's paradox in a loss network
- Optimal static customer routing in a closed queuing network
- Routing and Capacity Allocation in Networks with Trunk Reservation
This page was built for publication: Optimal Routing in Closed Queueing Networks with State Dependent Queues
