Prototype of the request in the service queue

Abstract

The development of a visual prototype of an application in a single queue for service is given. The pre-image connects the accounting for the growth of losses due to the duration of waiting with such sides of the importance of the application as urgency and priority. Varieties of change of urgency in time are discussed. The possibility of interpreting service as a lasting good is considered. On this basis, it is proposed to use relative losses as the main measure for determining the place of an application in the queue - the ratio of losses due to waiting to the duration of service. The example shows that the order in which service requests arrive depends on the time when the service facility starts accessing the queue and on the ratio of the service durations of individual requests. For the case of returning the service facility to the request after a forced interruption, the possibility of rivalry with it by other requests in the queue that have not yet arrived for servicing is considered. The possibility of working with the queue when servicing in small parts with a change in serviced requests is shown. For this type of work, expressions for step-by-step calculations are given. Calculations are made for two complicated cases of servicing a queue of five requests with a contradictory combination of the initial data of requests. A diagram of the switching of service facilities between requests is given. Taking into account the four sides of the description of the request in the queue at once provides the prototype with greater flexibility than most widely used queuing disciplines. The proposed prototype can be taken as a basis for building multi-parameter models of applications and algorithms for automatic control of the queue of applications for social, economic and computational applications.