Optimal arrangements for systems with an optimal service discipline (Q1107419)
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 4064739
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal arrangements for systems with an optimal service discipline |
scientific article; zbMATH DE number 4064739 |
Statements
Optimal arrangements for systems with an optimal service discipline (English)
0 references
1987
0 references
The problem of optimally allocating n servers on a plane for the service of n Poisson inputs is solved. Each input is served by the nearest server (in Euclidean metric). The non-preemptive (``the shortest customer is served first'') queueing discipline is used. The total size of the stationary waiting time as the optimality criterion is considered. The asymptotically optimal sequence of allocations is found.
0 references
optimal server allocation
0 references
nonpreemptive queueing discipline
0 references
planar allocation
0 references
Poisson inputs
0 references
Euclidean metric
0 references
0.8296712636947632
0 references
