Throughput maximization of queueing networks with simultaneous minimization of service rates and buffers.

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.creatorCruz, Frederico Rodrigues Borges da-
Autor(es): dc.creatorKendall, G.-
Autor(es): dc.creatorWhile, L-
Autor(es): dc.creatorDuarte, Anderson Ribeiro-
Autor(es): dc.creatorBrito, Nilson Luís Castelúcio-
Data de aceite: dc.date.accessioned2025-08-21T15:53:58Z-
Data de disponibilização: dc.date.available2025-08-21T15:53:58Z-
Data de envio: dc.date.issued2012-10-22-
Data de envio: dc.date.issued2012-10-22-
Data de envio: dc.date.issued2012-
Fonte completa do material: dc.identifierhttp://www.repositorio.ufop.br/handle/123456789/1734-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/capes/1026916-
Descrição: dc.descriptionThroughput 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.-
Formato: dc.formatapplication/pdf-
Idioma: dc.languageen-
Direitos: dc.rightsO 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.-
Título: dc.titleThroughput maximization of queueing networks with simultaneous minimization of service rates and buffers.-
Aparece nas coleções:Repositório Institucional - UFOP

Não existem arquivos associados a este item.