Calculation of the queuing systems characteristics in computer classes

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.

Authors

Institutions

Publication Details

Journal
Bulletin of Federal State University of Education Series Physics and Mathematics
Published
2024-09-13
DOI
https://doi.org/10.18384/2310-7251-2024-2-60-78
Primary Topic
Advanced Data Processing Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Calculation of the queuing systems characteristics in computer classes

Anis S. Khasanov
Bulletin of Federal State University of Education Series Physics and Mathematics
Advanced Data Processing Techniques
article

Calculation of the queuing systems characteristics in computer classes

Anis S. Khasanov
article en

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.

Bulletin of Federal State University of Education Series Physics and Mathematics(2)
Plekhanov Russian University of Economics (RU)
Openalex Percentile: Top 62%
Advanced Data Processing Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Calculation of the queuing systems characteristics in computer classes — Anis S. Khasanov · Bulletin of Federal State University of Education Series Physics and Mathematics (2024) | TGRS Research Map | TGRS