A Priority Queuing System with Server-Walking Time

DOI10.1287/OPRE.15.2.278zbMATH Open0147.36902OpenAlexW2002999787MaRDI QIDQ5525720FDOQ5525720

Authors: C. E. Skinner 

Publication date: 1967

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.15.2.278

zbMATH Keywords

probability theory

Cited In (13)

• A first-in-first-out buffered cyclic memory
• Analysis of a periodically inspected buffer
• The passport control problem or how to keep a dynamic service system load balanced?
• Some notes on the queueing analysis of the SCAN policy of the walking server
• Queueing models of secondary storage devices
• Analysis of channel and disk subsystems in computer systems
• Approximate mean value analysis based on Markov chain aggregation by composition
• Quality-related measures of unreliable machines with preventive maintenance
• Optimal design and control of queues
• Title not available (Why is that?)
• Time-dependent analysis of M/G/1 vacation models with exhaustive service
• The paging drum queue: A uniform perspective and further results
• Vacationing server model for \(M/G/1\) queues for rebuild processing in RAID5 and threshold scheduling for readers and writers

This page was built for publication: A Priority Queuing System with Server-Walking Time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5525720)