Scheduling networks of queues: Heavy traffic analysis of a simple open network (Q1825745)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Scheduling networks of queues: Heavy traffic analysis of a simple open network |
scientific article; zbMATH DE number 4121725
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Scheduling networks of queues: Heavy traffic analysis of a simple open network |
scientific article; zbMATH DE number 4121725 |
Statements
Scheduling networks of queues: Heavy traffic analysis of a simple open network (English)
0 references
1989
0 references
Brownian approximations
0 references
heavy traffic analysis
0 references
dynamic priority
0 references
pathwise solution
0 references
queueing network
0 references
two single-server stations
0 references
two types of customers
0 references
dynamic sequencing policy
0 references
long-run average expected number of customers
0 references
dynamic control
0 references
0.9616365
0 references
0.9509642
0 references
0.9380245
0 references
0.9311165
0 references
0.92966455
0 references
0.89886355
0 references
