A Simple And Quick Approximation Algorithm For Tandem, Split And Merge Queueing Networks With Blocking (Q4834080)
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 758173
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Simple And Quick Approximation Algorithm For Tandem, Split And Merge Queueing Networks With Blocking |
scientific article; zbMATH DE number 758173 |
Statements
A Simple And Quick Approximation Algorithm For Tandem, Split And Merge Queueing Networks With Blocking (English)
0 references
23 May 1995
0 references
blocking
0 references
approximation algorithm
0 references
queueing networks
0 references
average sojourn time
0 references
0.8772218823432922
0 references
0.829270601272583
0 references
0.8184964656829834
0 references
0.7973465323448181
0 references
