On the average optimality of circular assignment policy (Q1201826): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: A simple dynamic routing problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the optimal assignment of customers to parallel servers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimality of the shortest line discipline / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01164004 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2041043138 / rank | |||
Normal rank | |||
Latest revision as of 10:13, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the average optimality of circular assignment policy |
scientific article |
Statements
On the average optimality of circular assignment policy (English)
0 references
17 January 1993
0 references
parallel queueing system
0 references
average expected cost
0 references
circular assignment policy
0 references
