Abstract.
We consider scheduling a single server in a two-class M/M/1 queueing system with finite buffers subject to holding costs and rejection costs for rejected jobs. We use dynamic programming to investigate the structural properties of optimal policies. Provided that the delay of serving a job is always less costly than rejecting an arrival, we show that the optimal policy has a monotonic threshold type of switching curve; otherwise, numerical analysis indicates that the threshold structure may not be optimal.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received December 1996/Revised version May 1997
Rights and permissions
About this article
Cite this article
Kim, E., Van Oyen, M. Beyond the cμ rule: Dynamic scheduling of a two-class loss queue. Mathematical Methods of OR 48, 17–36 (1998). https://doi.org/10.1007/PL00003992
Issue Date:
DOI: https://doi.org/10.1007/PL00003992