Admission Policies in Loss Queueing Models with Heterogeneous Arrivals

E. Carrizosa, E. Conde and M. Muñoz-Márquez
Additional contact information
E. Carrizosa: Facultad de Matemáticas, Universidad de Sevilla, Tarfia s/n, 41012 Sevilla, Spain
E. Conde: Facultad de Matemáticas, Universidad de Sevilla, Tarfia s/n, 41012 Sevilla, Spain
M. Muñoz-Márquez: Departamento de Matemáticas, Universidad de Cádiz, Sacramento 82, Escuela Politécnica de Cádiz, 11002 Cádiz, Spain

Management Science, 1998, vol. 44, issue 3, 311-320

Abstract: In this paper we consider a loss system where the arrivals can be classified into different groups according to their arrival rate and expected service time. While the standard admission policy consists of rejecting only those customers who arrive when all servers are busy, we address the problem of finding the optimal static admission policy (with respect to a given reward structure) when customers can be discriminated according to the group they belong to, thus customers of some groups might be automatically rejected (even if some servers remain idle) in order to enhance the global efficiency of the system. The optimality of a c\mu -rule is shown, from which finite-time algorithms for the one- and two-server cases are derived.

Keywords: Algorithms; Multichannel Queues; Nonlinear Programming; Optimization (search for similar items in EconPapers)
Date: 1998
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.44.3.311 (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:ormnsc:v:44:y:1998:i:3:p:311-320

Access Statistics for this article

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