Admission Control with Incomplete Information of a Queueing System

Kyle Y. Lin () and Sheldon M. Ross ()
Additional contact information
Kyle Y. Lin: Grado Department of Industrial and Systems Engineering, Virginia Polytechnic Institute and State University, Blacksburg, Virginia 24061
Sheldon M. Ross: Department of Industrial Engineering and Operations Research, University of California, Berkeley, California 94720

Operations Research, 2003, vol. 51, issue 4, 645-654

Abstract: We consider a multiple-server loss model where customers arrive at a gatekeeper according to a Poisson process. A cost c is incurred if a new arrival is blocked from entering the system by the gatekeeper, while a larger cost K is incurred if an admitted customer finds all servers busy and therefore has to leave the system. The key assumption is that the gatekeeper is informed when an admitted customer finds all servers busy, but is not informed when served customers depart. Assuming an exponential service distribution, we show that, in the case of a single server, a threshold-type policy that blocks for a certain amount of time after a new arrival is admitted is optimal. When there are multiple servers, we propose two types of heuristic policies. We analytically compute the best policy of the first type, and use simulation to estimate that of the other.

Keywords: Dynamic programming/optimal control: applications in queueing systems; Queues: admission control; optimal and heuristic policies (search for similar items in EconPapers)
Date: 2003
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.51.4.645.16103 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:51:y:2003:i:4:p:645-654

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().