Look-Ahead Policies for Admission to a Single Server Loss System

Wim M. Nawijn
Additional contact information
Wim M. Nawijn: The University of Twente, Enschede, The Netherlands

Operations Research, 1990, vol. 38, issue 5, 854-862

Abstract: Consider a single server loss system in which the server, being idle, may reject or accept an arriving customer for service depending on the state at the arrival epoch. It is assumed that at every arrival epoch the server knows the service time of the arriving customer, the arrival time of the next customer and the service time. The server gets a fixed reward for every customer admitted to the system. The form of an optimal stationary policy is investigated for the discounted and average reward cases.

Keywords: dynamic programming; semiMarkov: admission control to a loss system; queues; optimization: input control to a single server loss system (search for similar items in EconPapers)
Date: 1990
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.38.5.854 (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:38:y:1990:i:5:p:854-862

Access Statistics for this article

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