An <i>M/G/c</i> queue in which the number of servers required is random (Q3221163): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q101200036, #quickstatements; #temporary_batch_1710982311091 |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.2307/3213620 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2324580940 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q101200036 / rank | |||
Normal rank | |||
Latest revision as of 03:06, 21 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An <i>M/G/c</i> queue in which the number of servers required is random |
scientific article |
Statements
An <i>M/G/c</i> queue in which the number of servers required is random (English)
0 references
1984
0 references
queueing system
0 references
Poisson arrival
0 references
approximations for the steady-state probabilities
0 references
