Abstract | ||
---|---|---|
The Buffer Allocation Problem (BAP) is a nonlinear, multi-objective one in integer variables and there exists no closed-form solution for the 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. Computational results demonstrate the effectiveness of this search methodology. |
Year | DOI | Venue |
---|---|---|
1997 | 10.1016/S0305-0548(96)00068-8 | Computers & OR |
Keywords | DocType | Volume |
buffer allocation,integer nonlinear network design | Journal | 24 |
Issue | ISSN | Citations |
5 | Computers and Operations Research | 11 |
PageRank | References | Authors |
0.85 | 13 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Ajay Singh | 1 | 44 | 6.18 |
J. MacGregor Smith | 2 | 496 | 61.72 |