A Sequence of Service Stations with Arbitrary Input and Regular Service Times
From MaRDI portal
Publication:5536014
Cited in
(18)- Sample-path large deviations for tandem and priority queues with Gaussian inputs
- Queueing theory
- Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines
- Reduction of a polling network to a single node
- Asymptotic analysis of Lévy-driven tandem queues
- Time-varying tandem queues with blocking: modeling, analysis, and operational insights via fluid models with reflection
- Analysis of an open tandem queueing network with population constraint and constant service times
- Path delays in communication networks
- Approximate analysis of exponential tandem queues with blocking
- Ordering of tandem constant-service stations to minimize in-process stock cost
- On the order of tandem queues
- Response time in a tandem queue with blocking, Markovian arrivals and phase-type services
- A study of queueing networks with deterministic service and application to computer networks
- Branch and Bound Algorithm for Ordering of Tandem Constant-Service Stations
- Manufacturing flow line systems: A review of models and analytical results
- The throughput rate of serial production lines with deterministic process times and random setups: Markovian models and applications to semiconductor manufacturing
- Time-varying many-server finite-queues in tandem: comparing blocking mechanisms via fluid models
- On the optimal assignment of servers in a two stations tandem queue with no intermediate waiting room
This page was built for publication: A Sequence of Service Stations with Arbitrary Input and Regular Service Times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5536014)
