?
Priority management in a semi-Markov queuing model
We study a single-channel queuing system with an arbitrary distribution of the duration of service requirements, on the input of which there are n Poisson processes. The requirements of the various processes come in dierent queues. The task is to determine the rule for selecting service requirements and to determine the optimal strategy for establish- ing dynamic priorities. We consider a case n = 2. To this end, a controlled semi-Markov process is dened, on the trajec- tories of which a functional is constructed that determines the quality of management and takes into account the number of lost requirements, the number of serviced requirements, the time of the requirement stay in the system, and so on. An algorithm for determining the optimal strategy is formulated.