Scholion.ai

Waiting and Interdeparture Times in Priority Queues with Poisson- and General-Arrival Streams

David A. Stanford

Operations Research · 1997 · Volume 45 · Issue 5

DOI: 10.1287/opre.45.5.725

Abstract

This paper presents new results for the interdeparture time distributions in single-server priority queues with an arbitrary number of high-priority Poisson-arrival classes and one lowest-priority general-arrival class. Little-known results for the waiting time distributions in the same queue are presented, including a new proof for the powerful result that the waiting time distribution in the non-preemptive priority queue is insensitive to the interarrival time distributions of lower-priority classes, beyond their mean.

Keywords

queues, priority, waiting times and interdeparture times

Enable JavaScript for citation tools and additional paper interactions.