Processing networks with parallel and sequential tasks: Heavy traffic analysis and Brownian limits (Q1210481)
From MaRDI portal
!
WARNING
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 179284
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Processing networks with parallel and sequential tasks: Heavy traffic analysis and Brownian limits |
scientific article; zbMATH DE number 179284 |
Statements
Processing networks with parallel and sequential tasks: Heavy traffic analysis and Brownian limits (English)
0 references
4 October 1993
0 references
sojourn time analysis
0 references
performance analysis
0 references
steady-state throughput time
0 references
queueing theory
0 references
multidimensional reflected Brownian motion
0 references
0.8216503858566284
0 references
0.8184831142425537
0 references
0.8083238005638123
0 references
0.8052857518196106
0 references
0.8043145537376404
0 references
