Queueing theory provides methods for analysis of complex service systems in computer systems, communications, transportation networks and manufacturing. It incorporates Markovian systems with exponential service times and a Poisson arrival process. Two queueing systems with losses are also briefly characterized. The article describes firefly algorithm, which is successfully used for optimization of these queueing systems. The results of experiments performed for selected queueing systems have been also presented.
 X. S. Yang, “Firefly algorithms for multimodal optimization”, Stochastic Algorithms: Foundations and Applications, SAGA, Lecture Notes in Computer Sciences 5792, 169-178 (2009).
 S. Łukasik and S. Żak, “Firefly algorithm for continuous constrained optimization task”, Computational Collective Intelligence. Semantic Web, Social Networks and Multiagent Systems LNCS 5796, 97-106 (2009).
 M.K. Sayadi, R. Ramezanian, and N. Ghaffari-Nasab, “A discrete firefly meta-heuristic with local search for makespan minimization in permutation flow shop scheduling problems”, Int. J. Industrial Eng. Computations 1, 1-10 (2010).
 G. Bolch, S. Greiner, H. de Meer, and K.S. Trivedi, Queueing Networks and Markov Chains. Modeling and Performance Evaluation with Computer Science Applications, John Wiley&Sons, London, 1998.
 B. Filipowicz, Modeling and Optimization of Queueing Systems. Volume 1, Markovian Systems, T. Rudkowski Publishing House, Cracow, 1999, (in Polish).
 B. Filipowicz and J. Kwiecień, “Queueing systems and networks: models and applications”, Bull. Pol. Ac.: Tech. 56 (4), 379-390 (2008).
 Ch.H. Lin and J.Ch. Ke, “Optimization analysis for an infinite capacity queueing system with multiple queue-dependent servers: genetic algorithms”, Int. J. Computer Mathematics 88 (7), 1430-1442 (2011).