Reduction Methods for Tandem Queuing Systems
From MaRDI portal
Publication:5519652
Cited in
(21)- Stationary queuing systems with dependencies
- Queueing theory
- Constant time per edge is optimal on rooted tree networks
- Asymptotic analysis of Lévy-driven tandem queues
- Sample-path large deviations for tandem and priority queues with Gaussian inputs
- Analysis of an open tandem queueing network with population constraint and constant service times
- Batch latency analysis and phase transitions for a tandem of queues with exponentially distributed service times
- Taylor series expansions for Poisson-driven (max,+)-linear systems
- Optimal order for two servers in tandem
- Path delays in communication networks
- Dependence among single stations in series and its applications in productivity improvement
- Ordering of tandem constant-service stations to minimize in-process stock cost
- A review of open queueing network models of manufacturing systems
- Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines
- Branch and Bound Algorithm for Ordering of Tandem Constant-Service Stations
- A heuristic for determining the optimal order in a tandem queue
- A study of queueing networks with deterministic service and application to computer networks
- Performance evaluation for general queueing networks in manufacturing systems: characterizing the trade-off between queue time and utilization
- On the order of tandem queues
- Reduction of a polling network to a single node
- An aggregation procedure for simulating manufacturing flow line models
This page was built for publication: Reduction Methods for Tandem Queuing Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5519652)
