Queue lengths and workloads in polling systems
From MaRDI portal
Publication:408416
DOI10.1016/J.ORL.2011.10.006zbMath1235.90043arXiv1106.0964OpenAlexW2136888963MaRDI QIDQ408416
Onno J. Boxma, Kamil M. Kosiński, Offer Kella
Publication date: 5 April 2012
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1106.0964
Related Items (10)
Polling: past, present, and perspective ⋮ Stochastic bounds for order flow times in parts-to-picker warehouses with remotely located order-picking workstations ⋮ The analysis of batch sojourn-times in polling systems ⋮ Waiting times in queueing networks with a single shared server ⋮ Performance analysis of polling systems with retrials and glue periods ⋮ Queue-length balance equations in multiclass multiserver queues and their generalizations ⋮ Analysis of tandem polling queues with finite buffers ⋮ On two-queue Markovian polling systems with exhaustive service ⋮ Decomposition results for stochastic storage processes and queues with alternating Lévy inputs ⋮ Analysis of polling models with a self-ruling server
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A queueing network with a single cyclically roving server
- Polling systems and multitype branching processes
- Mathematical methods to study the polling systems
- A STATE-DEPENDENT POLLING MODEL WITH k-LIMITED SERVICE
- Pseudo-conservation laws in cyclic-service systems
- Distribution of the workload in multiclass queueing systems with server vacations
- Polling Models With and Without Switchover Times
- Queues with Periodic Service and Changeover Time
This page was built for publication: Queue lengths and workloads in polling systems
