Use este identificador para citar ou linkar para este item: http://www.repositorio.ufop.br/jspui/handle/123456789/1734
Título: Throughput maximization of queueing networks with simultaneous minimization of service rates and buffers.
Autor(es): Cruz, Frederico Rodrigues Borges da
Kendall, G.
While, L
Duarte, Anderson Ribeiro
Brito, Nilson Luís Castelúcio
Data do documento: 2012
Referência: CRUZ, F. R. B. et al. Throughput maximization of queueing networks with simultaneous minimization of service rates and buffers. Mathematical Problems in Engineering, v. 2012, p. 1-19, 2012. Disponível em: <http://downloads.hindawi.com/journals/mpe/2012/692593.pdf>. Acesso em: 22 out. 2012.
Resumo: Throughput maximization of queueing networks with simultaneous minimization of service rates and buffers The throughput of an acyclic, general-service time queueing network was optimized, and the total number of buffers and the overall service r ate w as reduced. To satisfy t hese conflicting objectives, a multiobjective genetic algorithm w as developed and employed. Thus, our method produced a set of efficient solutions f or more than one objective in t he objective f unction. A comprehensive set of computational experiments w as conducted to determine t he efficacy and efficiency of the proposed approach. Interesting insights obtained from the analysis of a complex network may assist practitioners in planning general-service queueing networks.
URI: http://www.repositorio.ufop.br/handle/123456789/1734
ISSN: 15635147
Licença: O periódico Mathematical Problems in Engineering permite o arquivamento da versão PDF do editor. Fonte: Sherpa/Romeo <http://www.sherpa.ac.uk/romeo/issn/1024-123X/>. Acesso em: 03 jan. 2017.
Aparece nas coleções:DEMAT - Artigos publicados em periódicos

Arquivos associados a este item:
Arquivo Descrição TamanhoFormato 
ARTIGO_ThroughputMaximizationQueueing.pdf3,79 MBAdobe PDFVisualizar/Abrir


Os itens no repositório estão protegidos por copyright, com todos os direitos reservados, salvo quando é indicado o contrário.