M/G/c Queueing Systems with Multiple Customer Classes: Characterization and Control of Achievable Performance Under Nonpreemptive Priority Rules

Abstract

This paper considers an MIG/c queueing system serving a finite number (J) of distinct customer classes. Performance of the system, as measured by the vector of steady-state expected waiting times of the customer classes (the performance vector), may be controlled by adopting an appropriate priority discipline. We show that the performance space, the set of performance vectors which are achievable under some nonpreemptive work conserving priority rule, is a polyhedron described by 2J-1 inequalities. The special (polymatroidal) structure of this polyhedron, nevertheless, allows for efficient (O(J2 log J)) procedures to minimize any convex (separable) function of the performance vector. Linear objectives are shown to be minimized by absolute priority rules, thus generalizing a well-known result for MI G/l systems. We also show that each point in the performance space may be achieved by a unique, generalized dynamic priority rule, specified by J-1 parameters, which may be determined by the recursive solution of J-1 single variable quadratic equations. This class of rules contains the absolute priority rules and the (pure) dynamic rules as special cases. Our results are accurate up to one, extremely accurate, approximation and completely exact for MIGI 1 and MIMIc systems as well as in heavy traffic.

Telephone Call Centers: Tutorial, Review, and Research Prospects

“…Telephone Call Centers it uses results concerning the achievable performance of multiserver systems (Federgruen and Groenevelt 1988) to produce an upper bound. Finally, consider the following protocol, which is prevalent in practice.…”

Preparation of chemotherapy drugs: Planning policy for reduced waiting times

“…The non-preemptive priority system is used, because the pharmacists cannot shelve the unfinished medicine and resume preparation later. For this priority system we use the approach of Federgruen and Groenevelt [4], which gives the next approximation formula for the waiting time in the priority queue:…”

Multiclass Queueing Systems in Heavy Traffic: An Asymptotic Approach Based on Distributional and Conservation Laws

“…In this system we use conservation and distributional laws to find the expected number in the system from each class. 3. EGI/G/1 queue with changeover times and cyclic service, in which the server serves the various classes in a cyclic order, spending time dij when he moves from class i to class j (polling systems).…”

“…Related to System 2 (EGI/G/1 with priorities) Gelenbe and Mitrani [6], Federgruen and Groenevelt [3], [4] and Shantikumar and Yao [15] derive conservation laws for ex-pected performance measures. While conservation laws lead to explicit expressions for the performance of systems under priority policies for systems with Poisson arrivals, the performance for systems with general arrivals is not known.…”