Queues with infinitely many servers

Lajos Takács

RAIRO - Operations Research - Recherche Opérationnelle (1980)

  • Volume: 14, Issue: 2, page 109-113
  • ISSN: 0399-0559

How to cite

top

Takács, Lajos. "Queues with infinitely many servers." RAIRO - Operations Research - Recherche Opérationnelle 14.2 (1980): 109-113. <http://eudml.org/doc/104752>.

@article{Takács1980,
author = {Takács, Lajos},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {queues with infinitely many servers; recurrent process; limit distribution},
language = {eng},
number = {2},
pages = {109-113},
publisher = {EDP-Sciences},
title = {Queues with infinitely many servers},
url = {http://eudml.org/doc/104752},
volume = {14},
year = {1980},
}

TY - JOUR
AU - Takács, Lajos
TI - Queues with infinitely many servers
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 1980
PB - EDP-Sciences
VL - 14
IS - 2
SP - 109
EP - 113
LA - eng
KW - queues with infinitely many servers; recurrent process; limit distribution
UR - http://eudml.org/doc/104752
ER -

References

top
  1. 1. L. TAKÁCS, On a Coincidence Problem Concerning Telephone Traffic, Acta Mathematica Acad. Sc. Hungaricae, Vol. 9, 1958, pp. 45-81. Zbl0085.12603MR96320
  2. 2. L. TAKÁCS, A Moment Problem, Journal of the Australian Mathematical Society, Vol. 5, 1965, pp. 487-490.pp. Zbl0203.19801MR207020

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.