A Finite Capacity Dynamic Priority Queueing Model

Document Type

Article

Publication Date

5-24-1992

Publication Title

Computers and Industrial Engineering

Abstract

A single server queueing model with two types of arrivals is discussed under the assumptions of Poisson arrivals, (possibly different) general services and finite waiting room for each type of customer. Under a dynamic non-preemptive priority service rule, the steady state analysis of the model is performed. A number of interesting and intuitive results are obtained. In the case when the services are of phase type, implementable algorithms are developed for computing various system performance measures. The recursive computational schemes can be used interactively in the design of such queuing systems. A number of numerical examples are discussed.

Volume

22

Issue

4

First Page

369

Last Page

385

DOI

10.1016/0360-8352(92)90013-A

ISSN

ISSN: 0360-8352

Comments

This research was partially supported by GMI Research Initiation/Improvement Grant.

Rights

© 1992 Published by Elsevier Ltd.

This document is currently not available here.

Share

COinS