The non-preemptive `join the shortest queue-serve the longest queue' service system with or without switch-over times (Q6540473)
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: The non-preemptive `join the shortest queue-serve the longest queue' service system with or without switch-over times |
scientific article; zbMATH DE number 7849987
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The non-preemptive `join the shortest queue-serve the longest queue' service system with or without switch-over times |
scientific article; zbMATH DE number 7849987 |
Statements
The non-preemptive `join the shortest queue-serve the longest queue' service system with or without switch-over times (English)
0 references
15 May 2024
0 references
queueing
0 references
join the shortest queue
0 references
serve the longest queue
0 references
polling
0 references
probability generating functions
0 references
matrix geometric
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8294228315353394
0 references
0.7983896136283875
0 references
0.7581658363342285
0 references
0.7549664974212646
0 references
0.7513977885246277
0 references
