The cyclic queue with one general and one exponential server
From MaRDI portal
Publication:3314710
Recommendations
Cited in
(13)- scientific article; zbMATH DE number 3905605 (Why is no real title available?)
- Mathematical theory of queueing networks
- Two-Stage Cyclic Queues with Nonexponential Servers: Steady-State and Cyclic Time
- An efficient convolution algorithm for the non-Markovian two-node cyclic network
- The cycle-time distribution in a central server network with state-dependent branching
- The busy period distribution in a closed tandem of queues
- Optimal allocation of buffers and customers in a two-node cyclic network with multiple servers
- The cycle time distribution of exponential cyclic queues with multiple servers
- Stochastic bounds for order flow times in parts-to-picker warehouses with remotely located order-picking workstations
- scientific article; zbMATH DE number 3872448 (Why is no real title available?)
- An invariance property of sojourn times in cyclic networks
- The cyclic queue and the tandem queue
- Cyclic queueing networks with subexponential service times
This page was built for publication: The cyclic queue with one general and one exponential server
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3314710)