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

Detalhes bibliográficos
Autor(a) principal: Cruz, Frederico Rodrigues Borges da
Data de Publicação: 2012
Outros Autores: Kendall, G., While, L, Duarte, Anderson Ribeiro, Brito, Nilson Luís Castelúcio
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Institucional da UFOP
Texto Completo: http://www.repositorio.ufop.br/handle/123456789/1734
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.
id UFOP_22d98516986e4a80a690998c2f476256
oai_identifier_str oai:localhost:123456789/1734
network_acronym_str UFOP
network_name_str Repositório Institucional da UFOP
repository_id_str 3233
spelling Cruz, Frederico Rodrigues Borges daKendall, G.While, LDuarte, Anderson RibeiroBrito, Nilson Luís Castelúcio2012-10-22T21:30:10Z2012-10-22T21:30:10Z2012CRUZ, 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.15635147http://www.repositorio.ufop.br/handle/123456789/1734Throughput 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.Throughput maximization of queueing networks with simultaneous minimization of service rates and buffers.info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleO 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.info:eu-repo/semantics/openAccessengreponame:Repositório Institucional da UFOPinstname:Universidade Federal de Ouro Preto (UFOP)instacron:UFOPLICENSElicense.txtlicense.txttext/plain; charset=utf-81748http://www.repositorio.ufop.br/bitstream/123456789/1734/5/license.txt8a4605be74aa9ea9d79846c1fba20a33MD55ORIGINALARTIGO_ThroughputMaximizationQueueing.pdfARTIGO_ThroughputMaximizationQueueing.pdfapplication/pdf3879646http://www.repositorio.ufop.br/bitstream/123456789/1734/1/ARTIGO_ThroughputMaximizationQueueing.pdfdbf0df689424e277955b6734df247a89MD51123456789/17342019-03-13 11:01:04.475oai:localhost:123456789/1734Tk9URTogUExBQ0UgWU9VUiBPV04gTElDRU5TRSBIRVJFClRoaXMgc2FtcGxlIGxpY2Vuc2UgaXMgcHJvdmlkZWQgZm9yIGluZm9ybWF0aW9uYWwgcHVycG9zZXMgb25seS4KCk5PTi1FWENMVVNJVkUgRElTVFJJQlVUSU9OIExJQ0VOU0UKCkJ5IHNpZ25pbmcgYW5kIHN1Ym1pdHRpbmcgdGhpcyBsaWNlbnNlLCB5b3UgKHRoZSBhdXRob3Iocykgb3IgY29weXJpZ2h0Cm93bmVyKSBncmFudHMgdG8gRFNwYWNlIFVuaXZlcnNpdHkgKERTVSkgdGhlIG5vbi1leGNsdXNpdmUgcmlnaHQgdG8gcmVwcm9kdWNlLAp0cmFuc2xhdGUgKGFzIGRlZmluZWQgYmVsb3cpLCBhbmQvb3IgZGlzdHJpYnV0ZSB5b3VyIHN1Ym1pc3Npb24gKGluY2x1ZGluZwp0aGUgYWJzdHJhY3QpIHdvcmxkd2lkZSBpbiBwcmludCBhbmQgZWxlY3Ryb25pYyBmb3JtYXQgYW5kIGluIGFueSBtZWRpdW0sCmluY2x1ZGluZyBidXQgbm90IGxpbWl0ZWQgdG8gYXVkaW8gb3IgdmlkZW8uCgpZb3UgYWdyZWUgdGhhdCBEU1UgbWF5LCB3aXRob3V0IGNoYW5naW5nIHRoZSBjb250ZW50LCB0cmFuc2xhdGUgdGhlCnN1Ym1pc3Npb24gdG8gYW55IG1lZGl1bSBvciBmb3JtYXQgZm9yIHRoZSBwdXJwb3NlIG9mIHByZXNlcnZhdGlvbi4KCllvdSBhbHNvIGFncmVlIHRoYXQgRFNVIG1heSBrZWVwIG1vcmUgdGhhbiBvbmUgY29weSBvZiB0aGlzIHN1Ym1pc3Npb24gZm9yCnB1cnBvc2VzIG9mIHNlY3VyaXR5LCBiYWNrLXVwIGFuZCBwcmVzZXJ2YXRpb24uCgpZb3UgcmVwcmVzZW50IHRoYXQgdGhlIHN1Ym1pc3Npb24gaXMgeW91ciBvcmlnaW5hbCB3b3JrLCBhbmQgdGhhdCB5b3UgaGF2ZQp0aGUgcmlnaHQgdG8gZ3JhbnQgdGhlIHJpZ2h0cyBjb250YWluZWQgaW4gdGhpcyBsaWNlbnNlLiBZb3UgYWxzbyByZXByZXNlbnQKdGhhdCB5b3VyIHN1Ym1pc3Npb24gZG9lcyBub3QsIHRvIHRoZSBiZXN0IG9mIHlvdXIga25vd2xlZGdlLCBpbmZyaW5nZSB1cG9uCmFueW9uZSdzIGNvcHlyaWdodC4KCklmIHRoZSBzdWJtaXNzaW9uIGNvbnRhaW5zIG1hdGVyaWFsIGZvciB3aGljaCB5b3UgZG8gbm90IGhvbGQgY29weXJpZ2h0LAp5b3UgcmVwcmVzZW50IHRoYXQgeW91IGhhdmUgb2J0YWluZWQgdGhlIHVucmVzdHJpY3RlZCBwZXJtaXNzaW9uIG9mIHRoZQpjb3B5cmlnaHQgb3duZXIgdG8gZ3JhbnQgRFNVIHRoZSByaWdodHMgcmVxdWlyZWQgYnkgdGhpcyBsaWNlbnNlLCBhbmQgdGhhdApzdWNoIHRoaXJkLXBhcnR5IG93bmVkIG1hdGVyaWFsIGlzIGNsZWFybHkgaWRlbnRpZmllZCBhbmQgYWNrbm93bGVkZ2VkCndpdGhpbiB0aGUgdGV4dCBvciBjb250ZW50IG9mIHRoZSBzdWJtaXNzaW9uLgoKSUYgVEhFIFNVQk1JU1NJT04gSVMgQkFTRUQgVVBPTiBXT1JLIFRIQVQgSEFTIEJFRU4gU1BPTlNPUkVEIE9SIFNVUFBPUlRFRApCWSBBTiBBR0VOQ1kgT1IgT1JHQU5JWkFUSU9OIE9USEVSIFRIQU4gRFNVLCBZT1UgUkVQUkVTRU5UIFRIQVQgWU9VIEhBVkUKRlVMRklMTEVEIEFOWSBSSUdIVCBPRiBSRVZJRVcgT1IgT1RIRVIgT0JMSUdBVElPTlMgUkVRVUlSRUQgQlkgU1VDSApDT05UUkFDVCBPUiBBR1JFRU1FTlQuCgpEU1Ugd2lsbCBjbGVhcmx5IGlkZW50aWZ5IHlvdXIgbmFtZShzKSBhcyB0aGUgYXV0aG9yKHMpIG9yIG93bmVyKHMpIG9mIHRoZQpzdWJtaXNzaW9uLCBhbmQgd2lsbCBub3QgbWFrZSBhbnkgYWx0ZXJhdGlvbiwgb3RoZXIgdGhhbiBhcyBhbGxvd2VkIGJ5IHRoaXMKbGljZW5zZSwgdG8geW91ciBzdWJtaXNzaW9uLgo=Repositório InstitucionalPUBhttp://www.repositorio.ufop.br/oai/requestrepositorio@ufop.edu.bropendoar:32332019-03-13T15:01:04Repositório Institucional da UFOP - Universidade Federal de Ouro Preto (UFOP)false
dc.title.pt_BR.fl_str_mv Throughput maximization of queueing networks with simultaneous minimization of service rates and buffers.
title Throughput maximization of queueing networks with simultaneous minimization of service rates and buffers.
spellingShingle Throughput maximization of queueing networks with simultaneous minimization of service rates and buffers.
Cruz, Frederico Rodrigues Borges da
title_short Throughput maximization of queueing networks with simultaneous minimization of service rates and buffers.
title_full Throughput maximization of queueing networks with simultaneous minimization of service rates and buffers.
title_fullStr Throughput maximization of queueing networks with simultaneous minimization of service rates and buffers.
title_full_unstemmed Throughput maximization of queueing networks with simultaneous minimization of service rates and buffers.
title_sort Throughput maximization of queueing networks with simultaneous minimization of service rates and buffers.
author Cruz, Frederico Rodrigues Borges da
author_facet Cruz, Frederico Rodrigues Borges da
Kendall, G.
While, L
Duarte, Anderson Ribeiro
Brito, Nilson Luís Castelúcio
author_role author
author2 Kendall, G.
While, L
Duarte, Anderson Ribeiro
Brito, Nilson Luís Castelúcio
author2_role author
author
author
author
dc.contributor.author.fl_str_mv Cruz, Frederico Rodrigues Borges da
Kendall, G.
While, L
Duarte, Anderson Ribeiro
Brito, Nilson Luís Castelúcio
description 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.
publishDate 2012
dc.date.accessioned.fl_str_mv 2012-10-22T21:30:10Z
dc.date.available.fl_str_mv 2012-10-22T21:30:10Z
dc.date.issued.fl_str_mv 2012
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.citation.fl_str_mv 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.
dc.identifier.uri.fl_str_mv http://www.repositorio.ufop.br/handle/123456789/1734
dc.identifier.issn.none.fl_str_mv 15635147
identifier_str_mv 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.
15635147
url http://www.repositorio.ufop.br/handle/123456789/1734
dc.language.iso.fl_str_mv eng
language eng
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.source.none.fl_str_mv reponame:Repositório Institucional da UFOP
instname:Universidade Federal de Ouro Preto (UFOP)
instacron:UFOP
instname_str Universidade Federal de Ouro Preto (UFOP)
instacron_str UFOP
institution UFOP
reponame_str Repositório Institucional da UFOP
collection Repositório Institucional da UFOP
bitstream.url.fl_str_mv http://www.repositorio.ufop.br/bitstream/123456789/1734/5/license.txt
http://www.repositorio.ufop.br/bitstream/123456789/1734/1/ARTIGO_ThroughputMaximizationQueueing.pdf
bitstream.checksum.fl_str_mv 8a4605be74aa9ea9d79846c1fba20a33
dbf0df689424e277955b6734df247a89
bitstream.checksumAlgorithm.fl_str_mv MD5
MD5
repository.name.fl_str_mv Repositório Institucional da UFOP - Universidade Federal de Ouro Preto (UFOP)
repository.mail.fl_str_mv repositorio@ufop.edu.br
_version_ 1801685785283395584

Registros relacionados