Calculation of the queuing systems characteristics in computer classes
https://doi.org/10.18384/2310-7251-2024-2-60-78
Abstract
Aim of this article is to consider algorithms for calculating stationary characteristics of queuing systems in computer classes using an Excel spreadsheet processor.
Methodology. A summary of this topic is provided. A general approach is given for calculating the stationary characteristics of queuing systems. The general approach is specified for queuing systems with failures, with a queue and with an unlimited queue.
Results. One of the ways of organizing classes in computer classes in the study of queuing systems is described.
Research implications. The practical significance of the work is due to the need to conduct classes on queuing systems for some areas of student training. In conditions of strict time constraints, classes can be organized in computer classes. The proposed approach can be used by teachers both in the classroom and when organizing students’ independent work, since it uses the simplest tools of the publicly available Excel spreadsheet processor.
About the Author
A. S. Khasanov
Plekhanov Russian University of Economics
Russian Federation
Russian Federation
Anis S. Khasanov – Dr. Sci. (Phys.-Math.), Prof., Department of Higher Mathematics
Stremyanny pereulok 36, Moscow 115054
References
1. Gnedenko B. V., Kovalenko I. N. Vvedeniye v teoriyu massovogo obsluzhivaniya [Introduction to Queueing Theory]. Moscow, Nauka Publ., 1987. 336 p.
2. Saaty T. L. Elementy teorii massovogo obsluzhivaniya i yeye prilozheniya [Elements of Queueing Theory with Applications]. Moscow, Sovetskoye radio Publ., 1997. 520 p.
3. Kremer N. Sh. Teoriya veroyatnostey i matematicheskaya statistika [Probability Theory and Mathematical Statistics]. Moscow, Yuniti Publ., 2002. 543 p.
4. Kremer N. Sh., Putko B. A., Trishin I. M., Fridman M. N. Issledovaniye operatsiy v ekonomike [Operations Research in Economics]. Moscow, Yurayt Publ., 2021. 414 p.
5. Pleskunov M. A. Teoriya massovogo obsluzhivaniya [Queueing Theory]. Yekaterinburg, Ural University Publ., 2022. 264 p.
6. Cherusheva T. V., Zverovshchikova N. V. Teoriya massovogo obsluzhivaniya [Queueing Theory]. Penza, Penza State University Publ., 2021. 224 p.
7. Oleynikova S. A. Matematicheskoye modelirovaniye i sistemy massovogo obsluzhivaniya [Mathematical modeling and queueing systems]. Voronezh, Voronezh State Technical University Publ., 2021. 90 p.
8. Khasanov A. S. Individual'nyye zadaniya po lineynoy algebre i lineynomu programmirovaniyu [Individual assignments in linear algebra and linear programming]. Moscow, Plekhanov Russian University of Economics Publ., 2023. 48 p.
9. Napedenina Ye. Yu., Nikitina N. I. [On the issue of the culture of self-educational activities of students of the distance learning system]. In: Uchenyye zapiski Rossiyskogo gosudarstvennogo sotsial'nogo universiteta [Scientific Notes of the Russian State Social University], 2011, no. 9-1 (97), pp. 220–224.
10. Mushrub V. A., Makismenko M. N., Vybornova I. I., Fadeeva L. L. [Algorithmic approach to teaching graph theory]. In: Innovatsii i investitsii [Innovations and Investments], 2016, no. 6, pp. 202–208.
11. Makzhanova Ya. V., Zvereva A. I., Khachko O. I. Sbornik zadaniy po teme «Funktsiya dvukh peremennykh» [Collection of tasks on the topic “Function of two variables”]. Moscow, Belyy veter Publ., 2018. 38 p.
Review
Views:
68
Email this article 