Abstract
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. Copyright © 2012 F. R. B. Cruz et al.
Cite
CITATION STYLE
Cruz, F. R. B., Kendall, G., While, L., Duarte, A. R., & Brito, N. L. C. (2012). Throughput maximization of queueing networks with simultaneous minimization of service rates and buffers. Mathematical Problems in Engineering, 2012. https://doi.org/10.1155/2012/692593
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.