On the optimal allocation of customers that must depart in sequence (Q1331883)
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: On the optimal allocation of customers that must depart in sequence |
scientific article; zbMATH DE number 626241
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the optimal allocation of customers that must depart in sequence |
scientific article; zbMATH DE number 626241 |
Statements
On the optimal allocation of customers that must depart in sequence (English)
0 references
29 August 1994
0 references
queues with resequencing
0 references
optimal scheduling
0 references
round-robin allocation policy
0 references
0.85869455
0 references
0.8538036
0 references
0.8534526
0 references
0.85184723
0 references
0.85081804
0 references
0.84574795
0 references
0.84508693
0 references
0.8401799
0 references
