Analysis of cyclic service systems with limited service: Bounds and approximations

DOI10.1016/0166-5316(88)90023-5zbMath0651.90032OpenAlexW2064056181MaRDI QIDQ3796946

No author found.

Publication date: 1988

Published in: Performance Evaluation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-5316(88)90023-5

zbMATH Keywords

conservation lawpolling systemmean waiting timeslimited servicecyclic service queueing systemssimple approximationswaiting-time approximation

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (10)

Polling: past, present, and perspective ⋮ Models for parameter optimization of Timed Token Rotation Protocols ⋮ A discrete MAP/PH/1 queue with vacations and exhaustive time-limited service ⋮ Mathematical methods to study the polling systems ⋮ A decomposition result for a class of polling models ⋮ An approximate analysis of a cyclic server queue with limited service and reservations ⋮ \(M/G/1/N\) vacation model with varying \(E\)-limited service discipline ⋮ Traffic Management Heuristics for Bidirectional Segments on Double-Track Railway Lines ⋮ Dominance relations in polling systems ⋮ Workloads and waiting times in single-server systems with multiple customer classes

This page was built for publication: Analysis of cyclic service systems with limited service: Bounds and approximations