<abstract xmlns="http://www.w3.org/1999/xhtml"><p> In this paper, application of an evolutionary strategy to positioning a GI/M/1/N-type finite-buffer queueing system with exhaustive service and a single vacation policy is presented. The examined object is modeled by a conditional joint transform of the first busy period, the first idle time and the number of packets completely served during the first busy period. A mathematical model is defined recursively by means of input distributions. In the paper, an analytical study and numerical experiments are presented. A cost optimization problem is solved using an evolutionary strategy for a class of queueing systems described by exponential and Erlang distributions.</p></abstract>

In this paper, application of an evolutionary strategy to positioning a GI/M/1/N-type finite-buffer queueing system with exhaustive service and a single vacation policy is presented. The examined object is modeled by a conditional joint transform of the first busy period, the first idle time and the number of packets completely served during the first busy period. A mathematical model is defined recursively by means of input distributions. In the paper, an analytical study and numerical experiments are presented. A cost optimization problem is solved using an evolutionary strategy for a class of queueing systems described by exponential and Erlang distributions.

A finite-buffer queue with a single vacation policy: An analytical study with evolutionary positioning

Institute of Mathematics Silesian University of Technology, ul. Kaszubska 23, 44-100 Gliwice, Poland

Institute of Computational Intelligence Cestochowa University of Technology, Al. Armii Krajowej 36, 42-200 Częstochowa, Poland

Institute of Computational Intelligence Częstochowa University of Technology, Al. Armii Krajowej 36, 42-200 Cz˛estochowa, Poland

International Journal of Applied Mathematics and Computer Science

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

In this paper, application of an evolutionary strategy to positioning a GI/M/1/N-type finite-buffer queueing system with exhaustive service and a single...

A finite-buffer queue with a single vacation policy: An analytical study with evolutionary positioning

Published Online: Dec 20, 2014

Page range: 887 - 900

Received: Oct 16, 2013

DOI: https://doi.org/10.2478/amcs-2014-0065

© by Marcin Woźniak

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.