Modelagem e otimização de redes de filas finitas
The joint buer and server optimization problem (BCAP) is a non-linear optimization problem with integer decision variables that optimizes the number of buers and servers such that the resulting throughput is greater than a pre-dened threshold throughput. This work presents a detailed review of the c...
| Autor: | |
|---|---|
| Tipo de recurso: | tesis de maestría |
| Estado: | Versión publicada |
| Fecha de publicación: | 2016 |
| País: | Brasil |
| Institución: | Universidade Federal de Minas Gerais (UFMG) |
| Repositorio: | Repositório Institucional da UFMG |
| Idioma: | portugués |
| OAI Identifier: | oai:repositorio.ufmg.br:1843/ICED-AM6VAA |
| Acceso en línea: | http://hdl.handle.net/1843/ICED-AM6VAA |
| Access Level: | acceso abierto |
| Palabra clave: | Filas Finitas Redes de Filas Método da Expansão Generalizado Alocação de Servidores e Áreas de Espera Estatística Metodos de simulação Estatistica Métodos de simulação Teoria das filas |
| Sumario: | The joint buer and server optimization problem (BCAP) is a non-linear optimization problem with integer decision variables that optimizes the number of buers and servers such that the resulting throughput is greater than a pre-dened threshold throughput. This work presents a detailed review of the current literature that deals with allocation problems, especially the BCAP, and a quite eective methodology in solving this problem, which consists in a combination of approximate methods and Powell algorithm, a derivative-free optimization algorithm. The methodology was applied to networks of queues in series, split, and merge basic topologies, producing very encouraging results that pointed at robust and homogeneous solutions. |
|---|