Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-16T12:11:48.041Z Has data issue: false hasContentIssue false

THE BIAS OPTIMAL K IN THE M/M/1/K QUEUE: AN APPLICATION OF THE DEVIATION MATRIX

Published online by Cambridge University Press:  14 October 2015

Sophie Hautphenne
Affiliation:
Department of Mathematics and Statistics, University of Melbourne, Vic 3010, Australia E-mail: sophiemh@unimelb.edu.au
Moshe Haviv
Affiliation:
Department of Statistics and The Center for the Study of Rationality, The Hebrew University of Jerusalem, Mount Scopus Campus, Har Hatsofim, Jerusalem, 91905Israel E-mail: haviv@mscc.huji.ac.il
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We study the optimal buffer capacity K for the M/M/1/K queue under some standard cost and reward structures by comparing various Markov reward processes. Using explicit expressions for the deviation matrix of the underlying Markov chains, we find the bias optimal value for K in the case of a tie between two consecutive optimal gain policies. We show that the bias optimal value depends both on whether the reward is granted upon arrival or departure of the customers, and on the initial queue size. Moreover, we demonstrate that in some specific cases the optimal policy is threshold-based with respect to the initial queue size.

Information

Type
Research Article
Copyright
Copyright © Cambridge University Press 2015