Optimal priority assignment: a time sharing approach (Q3470236)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4137513
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal priority assignment: a time sharing approach |
scientific article; zbMATH DE number 4137513 |
Statements
Optimal priority assignment: a time sharing approach (English)
0 references
1989
0 references
Jobs of several types
0 references
infinite capacity discrete-time queues
0 references
time sharing policies
0 references
0.849130392074585
0 references
0.818084180355072
0 references
0.8081526756286621
0 references
0.8041650652885437
0 references
