%0 Conference Paper %1 esa20ITC32-2 %A Hyytiä, Esa %A Righter, Rhonda %A Virtamo, Jorma %B 32th International Teletraffic Congress (ITC 32) %C Osaka, Japan %D 2020 %K itc itc32 %T Admission Control to M/G/1 Subject to General Class-Specific Admission and Rejection Costs %U https://gitlab2.informatik.uni-wuerzburg.de/itc-conference/itc-conference-public/-/raw/master/itc32/esa20ITC32-2.pdf?inline=true %X We consider the M/G/1 queue where job sizes become known upon arrival subject to a general cost structure. More specifically, we are interested in determining the optimal admission policy to the (size-aware) system with multiple jobclasses each having its own admission and rejection costs. The cost for admitting a job is a class-specific function of the waiting time. As a special case, we consider a deadline cost structure where admitting a job that will be late has a smaller cost than rejecting it. We analyse the system within the framework of Markov decision processes, and derive expressions that enable us to determine the size-aware value function, and the optimal class-specific admission control, as well as the resulting mean cost. The availability of the value function allows one to develop efficient dispatching policies for a system with heterogeneous parallel servers.

@inproceedings{esa20ITC32-2, abstract = {We consider the M/G/1 queue where job sizes become known upon arrival subject to a general cost structure. More specifically, we are interested in determining the optimal admission policy to the (size-aware) system with multiple jobclasses each having its own admission and rejection costs. The cost for admitting a job is a class-specific function of the waiting time. As a special case, we consider a deadline cost structure where admitting a job that will be late has a smaller cost than rejecting it. We analyse the system within the framework of Markov decision processes, and derive expressions that enable us to determine the size-aware value function, and the optimal class-specific admission control, as well as the resulting mean cost. The availability of the value function allows one to develop efficient dispatching policies for a system with heterogeneous parallel servers.}, added-at = {2021-03-02T15:22:25.000+0100}, address = {Osaka, Japan}, author = {Hyytiä, Esa and Righter, Rhonda and Virtamo, Jorma}, biburl = {https://www.bibsonomy.org/bibtex/270de12df4ed185cdf7ed2bc87c12fe1c/itc}, booktitle = {32th International Teletraffic Congress (ITC 32)}, interhash = {27ecffe7248d3a8433c60bd48c385e01}, intrahash = {70de12df4ed185cdf7ed2bc87c12fe1c}, keywords = {itc itc32}, timestamp = {2021-03-02T15:22:25.000+0100}, title = {Admission Control to M/G/1 Subject to General Class-Specific Admission and Rejection Costs}, url = {https://gitlab2.informatik.uni-wuerzburg.de/itc-conference/itc-conference-public/-/raw/master/itc32/esa20ITC32-2.pdf?inline=true}, year = 2020 }