论文信息 - Preemptive Resume Priority Queue

Preemptive Resume Priority Queue

The queue length probability generating function for a preemptive resume priority queue characterized by Poisson arrivals and general service time distributions has been obtained by using the “supplemetary vanable method”. The preempted item follows the “resume” rule so that upon re-entry the service on the nonpriority unit is started at the point where it was interrupted when preemption occurred. Apart from the steady-state solution, the Laplace transform of the time dependent probability generating function and the length of busy periods has also been obtained.

N. K. Jaiswal | N. Jaiswal

[1] L. Christie,et al. Queuing with Preemptive Priorities or with Breakdown , 1958 .

[2] J. Keilson,et al. On Time Dependent Queuing Processes , 1960 .

[3] N. U. Prabhu,et al. Some Results for the Queue with Poisson Arrivals , 1960 .

[4] N. K. Jaiswal,et al. Time-Dependent Solution of the Head-Of-The-Line Priority Queue , 1962 .

[5] C. R. Heathcote. The Time-Dependent Problem for a Queue with Preemptive Priorities , 1959 .

[6] Alan Cobham,et al. Priority Assignment in Waiting Line Problems , 1954, Oper. Res..

[7] Frederick F. Stephan. Two Queues Under Preemptive Priority with Poisson Arrival and Service Rates , 1958 .