A method for solving stationary equations for priority time-sharing service process in random environment (Q1980538)
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: A method for solving stationary equations for priority time-sharing service process in random environment |
scientific article; zbMATH DE number 7392530
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A method for solving stationary equations for priority time-sharing service process in random environment |
scientific article; zbMATH DE number 7392530 |
Statements
A method for solving stationary equations for priority time-sharing service process in random environment (English)
0 references
8 September 2021
0 references
time-sharing queueing system with readjustment times
0 references
random external environment
0 references
non-ordinary input flows
0 references
stationary probability distribution
0 references
stationary probability computation algorithm
0 references
symbolic manipulation program application
0 references
0.8623187
0 references
0.85141987
0 references
0.84972316
0 references
0.8433522
0 references
0.84258324
0 references
