Zobrazeno 1 - 10
of 80
pro vyhledávání: '"Rami Atar"'
Publikováno v:
Nuclear Engineering and Technology, Vol 51, Iss 6, Pp 1616-1625 (2019)
Measuring occurrence times of random events, aimed to determine the statistical properties of the governing stochastic process, is a basic topic in science and engineering, and has been the subject of numerous mathematical modeling approaches. Often,
Externí odkaz:
https://doaj.org/article/bacac0cfdb344796abf9e38586ba3241
Autor:
Rami Atar, Mark Shifrin
Publikováno v:
Stochastic Systems, Vol 4, Iss 2, Pp 556-603 (2015)
For a multiclass G/G/1 queue with finite buffers, admission and scheduling control, and holding and rejection costs, we construct a policy that is asymptotically optimal in the heavy traffic limit. The policy is specified in terms of a single paramet
Externí odkaz:
https://doaj.org/article/3c96562e3bec499f8ab7c1b61510d120
Autor:
Rami Atar, Martin I. Reiman
Publikováno v:
Stochastic Systems, Vol 2, Iss 2, Pp 232-276 (2012)
A dynamic pricing problem that arises in are venue management context is considered, involving several resources and several demand classes, each of which uses a particular subset of the resources. The arrival rates of demand are determined by prices
Externí odkaz:
https://doaj.org/article/6765857fa7ac40b697d59bbe60b02c28
Publikováno v:
Mathematics of Operations Research. 47:232-258
For the M/M/1+M model at the law-of-large-numbers scale, the long-run reneging count per unit time does not depend on the individual (i.e., per customer) reneging rate. This paradoxical statement has a simple proof. Less obvious is a large deviations
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::17a050bbb380f2a57f8c5d764376b639
https://doi.org/10.1287/moor.2021.1127
https://doi.org/10.1287/moor.2021.1127
Publikováno v:
Queueing Systems. 100:277-279
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8224f7237480179756c0346f11a8913e
https://doi.org/10.1007/s11134-022-09753-y
https://doi.org/10.1007/s11134-022-09753-y
Autor:
David Lipshutz, Rami Atar
Publikováno v:
Mathematics of Operations Research. 46:268-300
We consider a load-balancing problem for a network of parallel queues in which information on the state of the queues is subject to a delay. In this setting, adopting a routing policy that performs well when applied to the current state of the queues
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8583a15c977f39ecafd5a232e9501541
https://doi.org/10.1287/moor.2020.1056
https://doi.org/10.1287/moor.2020.1056
Publikováno v:
Nuclear Science and Engineering. 195:256-270
Fluctuations associated with power and detector readings in a nuclear reactor, commonly known as reactor noise, are of great importance in nuclear science and engineering. Two different types of no...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3e9bb2c43a2bd2d569ff86744184e856
https://doi.org/10.1080/00295639.2020.1819136
https://doi.org/10.1080/00295639.2020.1819136
Publikováno v:
Stochastic Systems. 10:152-169
A parallel server system is considered in which a dispatcher routes incoming jobs to a fixed number of heterogeneous servers, each with its own queue. Much effort has been previously made to design policies that use limited state information (e.g., t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::30b125575e49a3ca66ea2e5eac88e13b
https://doi.org/10.1287/stsy.2019.0054
https://doi.org/10.1287/stsy.2019.0054
Publikováno v:
The Annals of Applied Probability. 31
This paper develops tools to obtain robust probabilistic estimates for queueing models at the large deviations (LD) scale. These tools are based on the recently introduced robust R\'enyi bounds, which provide LD estimates (and more generally risk-sen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::12700daf900418f2107cba4d9cdf4f07
https://doi.org/10.1214/20-aap1613
https://doi.org/10.1214/20-aap1613
Publikováno v:
Operations Research. 67:1678-1698
The degree to which delays or queue lengths equalize under load-balancing algorithms gives a good indication of their performance. Some of the most well-known results in this context are concerned with the asymptotic behavior of the delay or queue le
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1a56b18d32fb13e0aaf4e27303f0071e
https://doi.org/10.1287/opre.2019.1851
https://doi.org/10.1287/opre.2019.1851