O jednom modelu hromadné obsluhy
The busy period distribution of a discrete modified queue , with finitely or infinitely many severs , and with different distribution functions of customer service times is derived.
The minimum cost network flow problem, (MCNFP) constitutes a wide category of network flow problems. Recently a new dual network exterior point simplex algorithm (DNEPSA) for the MCNFP has been developed. This algorithm belongs to a special “exterior point simplex type” category. Similar to the classical dual network simplex algorithm (DNSA), this algorithm starts with a dual feasible tree-solution and after a number of iterations, it produces a solution that is both primal and dual feasible, i.e....
The minimum cost network flow problem, (MCNFP) constitutes a wide category of network flow problems. Recently a new dual network exterior point simplex algorithm (DNEPSA) for the MCNFP has been developed. This algorithm belongs to a special “exterior point simplex type” category. Similar to the classical dual network simplex algorithm (DNSA), this algorithm starts with a dual feasible tree-solution and after a number of iterations, it produces a...
A non-Markovian queueing system with Poisson input is studied under a modified operating rule called “control operating policy” in which the server begins “start-up” only when the queue length reaches a fixed number . By using the supplementary variable technique, the distribution of the queue length (excluding those being served) in the form of a generating function is obtained. As a special case, a Markovian queueing system with exponential start-up is discussed in detail to analyse the economic...