Cyclic service queues with very short service times

DOI10.1016/0377-2217(91)90133-GzbMath0729.60097OpenAlexW2005555093MaRDI QIDQ806207

L. D. Servi, Peter Kubat

Publication date: 1991

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(91)90133-g

zbMATH Keywords

cyclic service timeshybrid N- policy/T-policy scheduleOptimal schedulestelecommunication switching systems

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Optimal level of diagnostics in distributed communication systems
• Technical Note—A Note on the M/G/1 Queue with Server Vacations
• A note on stochastic decomposition in a GI/G/1 queue with vacations or set-up times
• Oscillating random walk models for GI/G/1 vacation systems with Bernoulli schedules
• Simple Ranking Methods for Allocation of One Resource
• Utilization of Idle Time in an M/G/1 Queueing System
• The T-Policy for the M/G/1 Queue
• Two Queues with Alternating Service
• Optimal Operating Policies for M/G/1 Queuing Systems
• Optimal Average-Cost Policy for a Queue with Start-Up and Shut-Down Costs
• An Approximate Method for Treating a Class of Multiqueue Problems

This page was built for publication: Cyclic service queues with very short service times