Priority servicing systems with variable parameters. I. Absolute priority

Priority servicing systems with absolute priority disciplines are analyzed. The amount of efforts in servicing customers of the class $k$ $(k=\overline{1, n})$ is a function of the queue length at the time of servicing start. The rate of input flows and servicing depend on the queue length of customers of this class. Laplace transforms are obtained of queue length, dump interval, and busy period distributions.