Mathematical Problems in Engineering
Volume 2012 (2012), Article ID 692593, 19 pages
Research Article

Throughput Maximization of Queueing Networks with Simultaneous Minimization of Service Rates and Buffers

1Departamento de Estatística, Universidade Federal de Minas Gerais, 31270-901 Belo Horizonte, MG, Brazil
2School of Computer Science, University of Nottingham, Jubilee Campus, Wollaton Road, Nottingham NG8 1BB, UK
3School of Computer Science & Software Engineering, The University of Western Australia, 35 Stirling Highway, Crawley, WA 6009, Australia
4Departamento de Matemática, Universidade Federal de Ouro Preto, 35400-000 Ouro Preto, MG, Brazil
5Departamento de Ciências Exatas, Universidade Estadual de Montes Claros, 39401-089 Montes Claros, MG, Brazil

Received 27 August 2011; Revised 11 November 2011; Accepted 12 November 2011

Academic Editor: Hung Nguyen-Xuan

Copyright © 2012 F. R. B. Cruz et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


The throughput of an acyclic, general-service time queueing network was optimized, and the total number of buffers and the overall service rate was reduced. To satisfy these conflicting objectives, a multiobjective genetic algorithm was developed and employed. Thus, our method produced a set of efficient solutions for more than one objective in the objective function. A comprehensive set of computational experiments was conducted to determine the 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.