Scholion.ai

The General Bulk Queue as a Hilbert Problem

Julian Keilson

Journal of the Royal Statistical Society: Series B (Statistical Methodology) · 1962 · Volume 24 · Issue 2

DOI: 10.1111/j.2517-6161.1962.tb00462.x

Abstract

Bulk queues are those in which customers arrive and are served in groups, with the size of the groups governed by given probability distributions. A general theory for arbitrary group size distributions is developed for Poisson arrival epochs and arbitrary service-time distribution. Phase space methods and devices for solving the Hilbert problem on the unit circle play a key role. Treated are both the ordinary queue in which the server finding an empty queue waits for new arrivals and the transportation queue in which the service epochs form a renewal process. Formal expressions are given for the server busy period and the equilibrium waiting-time distributions for the general case. The formalism is applied to several queueing situations untreated in the literature.

Enable JavaScript for citation tools and additional paper interactions.