An M/M/l queue with a generalized dynamic promotion rule
This paper discusses a generalized dynamic promotion rule for obtaining optimal policies for an M/M/1 priority queue. The author has justified the definition of generalized dynamic promotion rule. It is illustrated through several examples that the promotion rule discussed in the paper offers operating cost advantages over earlier formulations. The author has finally shown that the criterion for the generalized dynamic promotion rule is easily applicable to computer controlled systems. The paper seems to be quite interesting as it gives simple proofs of the earlier results.
- Optimal Control of an M/M/S Queueing System
- Two competing queues with linear costs and geometric service requirements: the μc-rule is often optimal
- Optimality of the generalized \(c\mu \) rule in the moderate deviation regime
- Dynamic scheduling with convex delay costs: The generalized \(c\mu\) rule
- scientific article; zbMATH DE number 4008076
This page was built for publication: An M/M/l queue with a generalized dynamic promotion rule
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3681700)