Priority Queue Model Research Articles

A Numerical Method to Obtain the Equilibrium Results for the Multiple Finite Source Priority Queueing Model

In this paper a numerical method is presented to obtain the equilibrium results of the multiple finite source queueing model having a single server using a nonpreemptive fixed priority service discipline and where each class of customers has a different exponential interarrival density function and arbitrary service time distribution function. This solution method uses the method of imbedded Markov Chain and the renewal reward theorem to find the proportion of time the server is busy with the customers of different classes. The equilibrium results are then related to these proportions using an extension of Little's formula.

A priority queuing model of a hospital pharmacy unit

This study analyzes various design alternatives in determining the manpower requirements needed to efficiently run a hospital's pharmacy unit. Several queuing models are used in the analysis. Because of the complexity of the problem, various assumptions have to be made in modelling the pharmacy's operations so that a solution using analytic methods can be found. This study was performed in order to provide the hospital administrator with a clear picture of what effect manpower will have on the waiting times of prescription orders under different conditions. In addition it gave quantitative data that supported current operating decisions. Three different operating procedures were evaluated in order to give a complete analysis of the prescription order process taking place in the pharmacy unit. These were a multiple server queuing model with no priorities, a priority discipline queuin model, and a priority discipline queuing model with preemptive service. Finally consideration was given to cost and waiting time objectives in order to determine the appropriate level of manpower.

Direct solutions of M/G/1 priority queueing models

Direct solutions of M/G/1 priority queueing models

The Queue M/G/1 with the Semipreemptive-Priority Queuing Discipline

This paper studies a priority queuing model in which the processing times of jobs are known upon arrival and preemption without loss of time or processing already accomplished is possible. Jobs are classified into K types according to their lengths, priority is assigned to them according to type and the length of processing remaining, and the paper obtains the expected conditional response times for jobs of each type.

Queuing Analysis of Real-Time Computer Processing

Recently the development of the real-time environment has influenced the design and altered the concepts of computer oriented systems. A priority queuing model was developed to analyse the performance of a simple real-time computer system. The jobs come from remoted stations and form a Poisson process. Each job consists of two tasks: the communication task which is placed in the high priority queue, and a processing task which is executed by the computer on an available basis. The stationary queue length and the waiting time distributions are investigated.

Queuing with Nonpreemptive and Preemptive-Resume Priorities

This paper considers a special queue situation, one in which a single facility serves two major priority classes of customers. Within each class, there are several levels of priorities. The first class has the higher priority. On arrival, a customer of the first class immediately replaces any customer of lower priority being served. The second class has the lower priority, as compared to the first class. On its arrival, a customer of the second class cannot interrupt the current service of a lower priority customer in the system; it must wait until the service is completed. The first class is the preemptive priority, and the second class is the nonpreemptive priority. This paper formulates a theoretical solution for this queuing system, which has a wide range of application in the computer industry. The real-time control program under the multiprogramming environment is an analog of this priority queuing model.

Queueing Systems with a Removable Service Station

A single-server queueing system with constant Poisson input is considered and the partial elimination of the station's idle fraction is envisaged by intermittent close-down and set-up. The rule pertaining to the dismantling and re-establishing of the service station—the management doctrine—is based on the instantaneous size of the queue, but these processes are assumed to consume time. Operating characteristics of such systems—in particular, average queue length and queueing time—are evaluated. A cost structure is superimposed on the system and optimization procedures are outlined. The close relationship with (a) priority queueing and (b) storage models is pointed out.