The cyclic queue with one general and one exponential server
From MaRDI portal
Publication:3314710
DOI10.2307/1427328zbMath0532.60091OpenAlexW2150288885MaRDI QIDQ3314710
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
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (9)
An invariance property of sojourn times in cyclic networks ⋮ Stochastic bounds for order flow times in parts-to-picker warehouses with remotely located order-picking workstations ⋮ Mathematical theory of queueing networks ⋮ The cyclic queue and the tandem queue ⋮ An efficient convolution algorithm for the non-Markovian two-node cyclic network ⋮ Cyclic queueing networks with subexponential service times ⋮ 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
This page was built for publication: The cyclic queue with one general and one exponential server