The Buffer Allocation Problem (BAP) is a nonlinear, multi-objective on
e in integer variables and there exists no closed-form solution for th
e objective function. An efficient and effective search methodology is
utilized to generate sub-optimal solutions to the problem for series,
merge, and split topologies with M/M/C/K queueing stations. Computati
onal results demonstrate the effectiveness of this search methodology.
(C) 1997 Elsevier Science Ltd. All rights reserved.