Abstract
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.