Optimal arrangements for systems with an optimal service discipline
type: Item
instance of: scholarly article
title: Optimal arrangements for systems with an optimal service discipline
zbMATH Open document ID: 0652.90045
author: T. V. Zakharova
published in: Moscow University Computational Mathematics and Cybernetics
publication date: 1987-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 90B22
Mathematics Subject Classification ID: 60K25
zbMATH DE Number: 4064739
zbMATH Keywords: optimal server allocation
zbMATH Keywords: nonpreemptive queueing discipline
zbMATH Keywords: planar allocation
zbMATH Keywords: Poisson inputs
zbMATH Keywords: Euclidean metric
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 4064739