Skip to main navigation Skip to search Skip to main content

Optimal admission to an M/M/k/N queue with several customer types and holding costs

  • Stony Brook University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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 paper 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.

Original languageEnglish
Title of host publication2010 49th IEEE Conference on Decision and Control, CDC 2010
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages2791-2796
Number of pages6
ISBN (Print)9781424477456
DOIs
StatePublished - 2010
Event49th IEEE Conference on Decision and Control, CDC 2010 - Atlanta, United States
Duration: Dec 15 2010Dec 17 2010

Publication series

NameProceedings of the IEEE Conference on Decision and Control
ISSN (Print)0743-1546
ISSN (Electronic)2576-2370

Conference

Conference49th IEEE Conference on Decision and Control, CDC 2010
Country/TerritoryUnited States
CityAtlanta
Period12/15/1012/17/10

Fingerprint

Dive into the research topics of 'Optimal admission to an M/M/k/N queue with several customer types and holding costs'. Together they form a unique fingerprint.

Cite this