Fajardo, Val AndreiDrekic, Steve2017-07-102017-07-102017-03-01http://dx.doi.org/10.1007/s11009-015-9476-1http://hdl.handle.net/10012/12058The final publication is available at Springer via http://dx.doi.org/10.1007/s11009-015-9476-1We consider a queueing system in which a single server attends to N priority classes of customers. Upon arrival to the system, a customer begins to accumulate priority linearly at a rate which is distinct to the class to which it belongs. Customers with greater accumulated priority levels are given preferential treatment in the sense that at every service selection instant, the customer with the greatest accumulated priority level is selected next for servicing. Furthermore, the system is preemptive so that the servicing of a customer is interrupted for customers with greater accumulated priority levels. The main objective of the paper is to characterize the waiting time distributions of each class. Numerical examples are also provided which exemplify the true benefit of incorporating an accumulating prioritization structure, namely the ability to control waiting times.enAccumulating priorityPreemptive priorityDynamic priority queuesMaximal priority processLaplace-Stieltjes transformQueueing theoryPerformance evaluationSchedulingQueues and servicesArticle