Computational schemes for two exponential servers where the first has a finite buffer (Q3016174)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5920473
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational schemes for two exponential servers where the first has a finite buffer |
scientific article; zbMATH DE number 5920473 |
Statements
Computational schemes for two exponential servers where the first has a finite buffer (English)
0 references
14 July 2011
0 references
queueing
0 references
performance evaluation
0 references
scheduling
0 references
queues and service
0 references
0 references
0 references
0.8353275
0 references
0.8160206
0 references
