Queuing system with the shortest call served first without interruption. I (Q1060675)
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: Queuing system with the shortest call served first without interruption. I |
scientific article; zbMATH DE number 3908134
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Queuing system with the shortest call served first without interruption. I |
scientific article; zbMATH DE number 3908134 |
Statements
Queuing system with the shortest call served first without interruption. I (English)
0 references
1985
0 references
An M/G/1 system with waiting and continuous relative priorities is considered. Formulas are obtained for the stationary distribution of the time of waiting for the beginning of service of a call of given priority and the distribution of the number of calls of different priorities in the system at the instant t.
0 references
M/G/1 system
0 references
waiting
0 references
continuous relative priorities
0 references
stationary distribution
0 references
0.8499817848205566
0 references
0.8210510611534119
0 references
0.8196585178375244
0 references