Optimal admission control for M/D/1/K queueing systems

Hans Daduna and Pavel S. Knopov

Mathematical Methods of Operations Research, 1999, vol. 50, issue 1, 100 pages

Abstract: For a single server loss system with finite waiting room with Poisson arrivals and deterministic service times we compute the optimal admission control rule when additionally to the queue length the residual service time is considered as a decision variable. The reward function is of a rather general form. The optimal policy for maximizing the average reward per time unit is of threshold structure. Some of the results are generalized to the case of renewal arrivals. Copyright Springer-Verlag Berlin Heidelberg 1999

Keywords: Key words: Average reward criterion; monotone value function; G/D/1/K queue; threshold policy (search for similar items in EconPapers)
Date: 1999
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1007/s001860050037 (text/html)
Access to full text is restricted to subscribers.

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:spr:mathme:v:50:y:1999:i:1:p:91-100

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186

DOI: 10.1007/s001860050037

Access Statistics for this article

Mathematical Methods of Operations Research is currently edited by Oliver Stein

More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().