An M/M/l queue with a generalized dynamic promotion rule

The paper presents an approach to obtaining optimal policies for an M/M/l priority queue. The approach extends the previous works and develops a ‘generalized dynamic promotion rule’. This rule is dynamic in the sense that the decision to promote is made at each service completion epoch based on the state of the queue at that time. It is shown through several examples that this promotion rule offers operating cost advantages over previous formulations.