You are not currently logged in.
Access JSTOR through your library or other institution:
Solving Queueing Systems with Increasing Priority Numbers
The Journal of the Operational Research Society
Vol. 31, No. 7 (Jul., 1980), pp. 637-646
Stable URL: http://www.jstor.org/stable/2580853
Page Count: 10
You can always find the topics here!Topics: Customers, Simulations, Operations research, Modeling, Random numbers, Algorithms
Were these topics helpful?See somethings inaccurate? Let us know!
Select the topics that are inaccurate.
Preview not available
This paper deals with those queueing systems for which the priority numbers are increased perpetually. A general computational algorithm capable of solving the problem for preemptive and nonpreemptive priority is proposed; the corresponding operating characteristics, three representative examples and a military illustration are given.
The Journal of the Operational Research Society © 1980 Operational Research Society