Computational schemes for two exponential servers where the first has a finite buffer
RAIRO-Oper. Res., 45 1 (2011) 17-36
Published online: 2011-05-10
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Proofs of conjectures on the competition between observable and unobservable servers
Bara Kim, Jeongsim Kim, Yan Su and Chia-Li WangQueueing Systems 104 (3-4) 211 (2023)
https://doi.org/10.1007/s11134-023-09887-7
On equilibrium threshold strategies when choosing between observable and unobservable queues
Nimrod Dvir, Refael Hassin and Moshe HavivOperations Research Letters 50 (5) 555 (2022)
https://doi.org/10.1016/j.orl.2022.08.004
Strategic customer behavior in a two-stage batch processing system
Olga Bountali and Antonis EconomouQueueing Systems 93 (1-2) 3 (2019)
https://doi.org/10.1007/s11134-019-09615-0
Pure threshold strategies for a two-node tandem network under partial information
Bernardo D’Auria and Spyridoula KantaOperations Research Letters 43 (5) 467 (2015)
https://doi.org/10.1016/j.orl.2015.06.014
450 (2013)
https://doi.org/10.1109/CCGrid.2013.18
Queues
Moshe HavivInternational Series in Operations Research & Management Science, Queues 191 181 (2013)
https://doi.org/10.1007/978-1-4614-6765-6_12