University of AmsterdamUniversity of AmsterdamUvA

  • Terms of use
  • Contact

UvA-DARE (Digital Academic Repository)

  • Home
  • Advanced Search
  • Browse
  • My selection

Search UvA-DARE

Author
E.L. Ormeci
J. van der Wal
Year
2006
Title
Admission Policies for a Two Class Loss System with General Interarrival Times
Journal
Stochastic Models
Volume | Issue number
22 | 1
Pages (from-to)
37-53
Number of pages
17
Document type
Article
Faculty
Faculty of Economics and Business (FEB)
Institute
Amsterdam School of Economics Research Institute (ASE-RI)
Abstract
This paper considers the problem of dynamic admission control in a loss queueing system with two classes of jobs. The jobs require an exponential amount of service time with different means and bring different revenues, whereas the arrivals occur according to a general distribution. We establish the existence of optimal acceptance thresholds for both job classes and show that under certain conditions there exists a preferred class. We also provide an example to demonstrate that for a Markov modulated Poisson arrival process there may be states in which both classes are rejected.
Keywords: Dynamic admission control; General interarrival times; Loss systems; Treshold policies
Mathematics Subject Classification: Primary 90C40, 90B22; Secondary 60K20
URL
go to publisher's site
Language
Undefined/Unknown
Permalink
http://hdl.handle.net/11245/1.270680

Disclaimer/Complaints regulations

If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library, or send a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible.

PrintPrint this pageShareShare via emailShare on facebookShare on linkedinShare on twitter
  • University library
  • About UvA-DARE
  • Disclaimer
Copyright UvA 2014