Look-ahead policies for admission to a single server loss system

W.M. Nawijn

Research output: Contribution to journalArticleAcademicpeer-review

7 Citations (Scopus)
95 Downloads (Pure)


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.
Original languageEnglish
Pages (from-to)854-862
Number of pages9
JournalOperations research
Issue number5
Publication statusPublished - 1990

Fingerprint Dive into the research topics of 'Look-ahead policies for admission to a single server loss system'. Together they form a unique fingerprint.

Cite this