Analysis and optimization of a heavily loaded queueing system with dynamic priorities according to the number of calls (Q1062602)
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: Analysis and optimization of a heavily loaded queueing system with dynamic priorities according to the number of calls |
scientific article; zbMATH DE number 3914053
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Analysis and optimization of a heavily loaded queueing system with dynamic priorities according to the number of calls |
scientific article; zbMATH DE number 3914053 |
Statements
Analysis and optimization of a heavily loaded queueing system with dynamic priorities according to the number of calls (English)
0 references
1984
0 references
The operation of a queueing system (QS) with dynamic priorities is studied under heavy load conditions. By going over to a continuous phase space, it is possible to construct an equation whose solution specifies the distribution density that approximates the distribution of the QS states. With the aid of this solution it is possible to find an optimal control for the original system.
0 references
asymptotic approximation of the system
0 references
queueing system
0 references
dynamic priorities
0 references
heavy load conditions
0 references
optimal control
0 references
