Abstract Under the assumption of a low intensity flow incoming requests and high speed their service, M|M|1 system utilization factor model is considered. It estimated for small part observation time. Approximate relations are obtained factor. Its simple probabilistic in form mixture proposed. A comparison with results simulation carried out.

Most of the real queuing systems include special properties and constraints, which can not be analyzed directly by using the results of solved classical queuing models. Lack of Markov chains features, unexponential patterns and service constraints, are the mentioned conditions. This paper represents an applied general algorithm for analysis and optimizing the queuing systems. The algorithm stag...

Customer impatience has a very negative impact on the queuing system under investigation. If we talk from business point of view, the firms lose their potential customers due to customer impatience, which affects their business as a whole. If the firms employ certain customer retention strategies, then there are chances that a certain fraction of impatient customers can be retained in the queui...

 In this paper a single server queuing production system is considered which is subject to gradual deterioration. The system is discussed under two different deteriorating conditions. A planning horizon is considered and server which is a D/M/1 queuing system is gradually deteriorates through time periods. A maintenance policy is taken into account whereby the server is restored to its initial ...

In this paper, we consider a queuing model extension for a manufacturing cell composed of a machining center and several parallel downstream predestinations. In the machining center, there is an ample supply of raw material for a number of different part-types. For each type, parts are first processed in the machining center, and then in one of parallel production stations (one for each type). ...

In this paper, the state diagrams and steady-state balance equations for two kinds of open queuing network models are presented. The first model comprises a network of single queues with single servers, while the second model comprises multiple servers for single queues. State diagrams are drawn for (2,3) queuing networks with (i) single servers and (ii) multiple servers. Steady-state balance e...