The cyclic queue with one general and one exponential server
From MaRDI portal
Publication:3314710
DOI10.2307/1427328zbMATH Open0532.60091OpenAlexW2150288885MaRDI QIDQ3314710FDOQ3314710
Authors: Onno Boxma 
Publication date: 1983
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1427328
Recommendations
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cited In (13)
- An efficient convolution algorithm for the non-Markovian two-node cyclic network
- The cycle time distribution of exponential cyclic queues with multiple servers
- Title not available (Why is that?)
- Optimal allocation of buffers and customers in a two-node cyclic network with multiple servers
- An invariance property of sojourn times in cyclic networks
- The cycle-time distribution in a central server network with state-dependent branching
- The busy period distribution in a closed tandem of queues
- Two-Stage Cyclic Queues with Nonexponential Servers: Steady-State and Cyclic Time
- Cyclic queueing networks with subexponential service times
- Stochastic bounds for order flow times in parts-to-picker warehouses with remotely located order-picking workstations
- Title not available (Why is that?)
- The cyclic queue and the tandem queue
- Mathematical theory of queueing networks
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)
