CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Admission control policies in a finite capacity Geo/Geo/1 queue under partial state observations
Authors
A. Burnetas Kokaliaris, C.
Publication date
1 January 2014
Publisher
Abstract
We consider the problem of admission control in a discrete time Markovian queue with a finite capacity, a single server, and a geometric arrival and departure processes. We prove the threshold structure of the optimal admission policy under full information on the number of customers in the system. We also consider the admission control problem under partial state information, where the decision maker is only informed whether the system is empty, full, or in some intermediate state. We formulate this problem as a Markov Decision Process with the state representing the posterior distribution of the number of customers and apply a heuristic algorithm from the literature to approximate the optimal policy. In numerical experiments we demonstrate that the pair of the mean and variance of the posterior distribution may be effectively used instead of the full distribution, to implement the optimal policy. We also explore the behavior of the profit function and the value of information with respect to several system parameters. © 2014, Springer International Publishing Switzerland
Similar works
Full text
Available Versions
Pergamos : Unified Institutional Repository / Digital Library Platform of the National and Kapodistrian University of Athens
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:lib.uoa.gr:uoadl:3024962
Last time updated on 10/02/2023