Search

The general problem is that of locating a central facility in a network so as to minimize the sum of its distances from the sources of flow to it, each distance being appropriately weighted to reflect the associated flow volume and/or cost. In this paper, simple one-pass solution algorithms are given for two classes of topologically simple networks, namely those which are either acyclic or contain exactly one cycle. The first algorithm is based on a reduction procedure that may also yield useful simplification of problems involving general networks. [ABSTRACT FROM AUTHOR]

In this paper the authors find the optimal allocation of servicing periods to a facility servicing N incoming traffic streams. In our model it is assumed that stream flows are deterministic, that there is a fixed amount of lime lost, τi , when the server switches attention from the ith to the i + 1st stream and that the objective is to minimize time average delay. [ABSTRACT FROM AUTHOR]