Abstract
The study of non-stationary queuing systems is related to their important applications in computing systems. Algorithms for calculating non-stationary queuing systems are quite complex. Nevertheless, the development of modelling of production processes and communications, trade processes and consumer services requires the development of methods for calculating such queuing systems. In this regard, we should mention the currently actively developing state programs ”Smart city”, ”Digitalization of the economy” which require the development and specification of methods for calculating non-stationary queuing systems. Therefore, it is necessary to build non-stationary queuing models in such a way that their calculation would be quite simple and convenient for computing. In this paper, this can be achieved by assuming that the service time is deterministic, the input non-stationary flow of customers is Poisson, and that there are an infinite number of devices that exclude the customers from being in the queue.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
