Martins, Helgem de Souza RibeiroCruz, Frederico Rodrigues Borges daDuarte, Anderson RibeiroOliveira, Fernando Luiz Pereira de2019-06-102019-06-102019MARTINS, H. de S. R. et al. Modeling and optimization of buffers and servers in finite queueing networks. Opsearch, Delhi, v. 56, n. 1, p. 123-150, 2019. Disponível em: <https://link.springer.com/article/10.1007/s12597-019-00362-7>. Acesso em: 19 mar. 2019.0975-0320http://www.repositorio.ufop.br/handle/123456789/11502The joint buffer and server optimization problem (BCAP) is a non-linear optimization problem with integer decision variables that optimizes the numbers of buffers and servers such that the resulting throughput is greater than a pre-defined threshold throughput. This work presents a detailed review of the current literature that addresses allocation problems, particularly the BCAP, and a quite effective methodology for solving this problem, which consists of a combination of approximate methods and the Powell algorithm, a derivative-free optimization algorithm. The methodology was applied to networks of queues in the basic topologies series, split, and merge, producing very encouraging results that pointed at robust and homogeneous solutions.en-USrestritoBuffer and server allocationGeneralized expansion methodModeling and optimization of buffers and servers in finite queueing networks.Artigo publicado em periodicohttps://link.springer.com/article/10.1007/s12597-019-00362-7https://doi.org/10.1007/s12597-019-00362-7