Optimality of trunk reservation for an m/m/k/n queue with several customer types and holding costs

Authors:
Eugene a. Feinberg;Fenghsu Yang
Affiliations:
Department of applied mathematics and statistics, state university of new york at stony brook, ny 11794-3600, stony brook, usa e-mail: eugene.feinberg@sunysb.edu/ fyang@ic.sunysb.edu;Department of applied mathematics and statistics, state university of new york at stony brook, ny 11794-3600, stony brook, usa e-mail: eugene.feinberg@sunysb.edu/ fyang@ic.sunysb.edu
Venue:
Probability in the Engineering and Informational Sciences
Year:
2011

Citing 3
Cited 1

Markov Decision Processes: Discrete Stochastic Dynamic Programming

Markov Decision Processes: Discrete Stochastic Dynamic Programming
BIAS OPTIMALITY IN A QUEUE WITH ADMISSION CONTROL

Probability in the Engineering and Informational Sciences
Optimality Of Randomized Trunk Reservation For A Problem With Multiple Constraints

Probability in the Engineering and Informational Sciences

Dynamic price optimization for an M/M/k/N queue with several customer types

ACM SIGMETRICS Performance Evaluation Review

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this article we study optimal admission to an M/M/k/N queue with several customer types. The reward structure consists of revenues collected from admitted customers and holding costs, both of which depend on customer types. This article studies average rewards per unit time and describes the structures of stationary optimal, canonical, bias optimal, and Blackwell optimal policies. Similar to the case without holding costs, bias optimal and Blackwell optimal policies are unique, coincide, and have a trunk reservation form with the largest optimal control level for each customer type. Problems with one holding cost rate have been studied previously in the literature.