priority queues have a great importance in the study of computer communication networks in which different types of traffic require different quality of service standards. the discrete-time non-preemptive priority queuing model with priority jumps is proposed in this paper. on the basis of probability generating functions mean system contents and mean queuing delay characteristics are obtained....

Priority queues have a great importance in the study of computer communication networks in which different types of traffic require different quality of service standards. The discrete-time non-preemptive priority queuing model with priority jumps is proposed in this paper. On the basis of probability generating functions mean system contents and mean queuing delay characteristics are obtained....

The paper considers multivariate discrete random sums with equal number of summands. Such distributions describe the total claim amount received by a company in a fixed time point. In Queuing theory they characterize cumulative waiting times of customers up to time t. In Theory of branching processes they model the number of heirs at a fixed point in time. Here some general properties and formu...

Queuing theory strives to provide analytical solutions to a number of queuing problems. Unfortunately, closed analytical expressions can not be derived for every type of queuing system. Discrete event simulation on the other hand can find solutions to any kind of queuing problem, but the results are stochastic and only specific to a single parameterization. Proxel simulation can bridge the gap ...

there are some problems with estimating the time required for the manufacturing process of products, especially when there is a variable serving time, like control stage. these problems will cause overestimation of process time. layout constraints, reworking constraints and inflexible product schedule in multi product lines need a precise planning to reduce volume in particular situation of lin...

Queuing theory has extensively studied the problem of estimating job execution times in steady state conditions both in the case of single queues and queuing networks. This paper discusses the use of closed Queuing Network (QN) models during finite time intervals to estimate the execution time of jobs submitted to a computer system. More specifically, the paper presents the Epochs algorithm tha...

In this paper provides the results of research on the development of the method of constructing a model of customs procedures in terms of the theory of queuing systems based on their description by means of functional modeling IDEF0. The technique is based on use of the integrated IDEF0 models and theory of queuing systems with the ability to transition from a description of the system in IDEF0...