Model of a queuing system with heterogeneous customers and the absolute priority of service

Бесплатный доступ

The simulation algorithm of functioning of single channel queuing system has been worked out. It has the relative priority of service. When comparing it with the previous published works of other authors, it is distinguished a number of advantages: the absense of go to operators and as a result, better visibility and more easier maintainbility of the code? Smaller codelength with the same complexity of the algorithm.

Queuing system, relative priority, modeling, algorithm

Короткий адрес: https://sciup.org/14730024

IDR: 14730024

Статья научная