Abstract
This paper considers the delay dependent priority queueing discipline with P non-preemptive priority classes. The priority at time t of a customer from the pth priority class, who arrives at time Tp, is given by qp(t) = ap + bp(t - Tp). The result has been derived for the expected waiting time of a customer from the pth priority class.