Algorithmic Analysis of a Dynamic Priority Queue

Abstract

Implementable algorithms are developed for a single server queue serving two types of customers and operating under a dynamic non-preemptive priority rule which assigns higher priority to type 1 customers when their queue length exceeds a pre-assigned theshold N, and to type 2 customers otherwise. The model is discussed under the assumption of a finite waiting room of size K-1 for type 2 customers and for the case of general service times and Poisson arrivals. The recursive computational schemes, which are obtained here using the function-analytic methods recently introduced by M. F. Neuts, can be used interactively in the design of such systems for arriving at desirable values of N and K. A self-contained section of numerical examples illustrates some interesting qualitative aspects of such a model. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 14 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.