# Replace the queue analyse system

## In the service system

The configuration of these and additional configurations is plotted as follows: Distribution service times: as arrivals to the system, the time when the entities are queue management price handled within the system tend to be independent of one another and random, so it is common to represent a probability distribution. Important: queuing theory can also be found that the service times are constant, which can be found in automated processes. This variant will see it as the ultimate model of analysis on this issue.

Kendall notation All queuing systems can be represented more simply by using the notation developed by Kendall AG, which intends to be represented by three characters the queue management system type of system being analysed. Customers arrive at a hardware store Hanks according to the distribution. The store opens at 8:00 am and Tuesdays Average6 customers come in between and. Hank went to a party on Monday night and want to sleep half an hour Extra on Tuesday, and is concerned that if you open a half hour late too could lose sales. So you want to know.

Used the same average service time for dispensing a cup of coffee, a vending machine; service time can be modelled with a constant distribution (whichever is practically the same for all customers). If the service times are random with a known mean, you can use the exponential distribution. Hank estimated it takes an average of four minutes to treat each customer and service times follow an exponential function, Hank has an important appointment to eat, so queue management system you want to find the probability that it takes less than three minutes to address the next customer.

One of the properties of probability distributions view is that queue management price they have no memory, no more probability is obtained if more time is expected both arrivals and service; since each arrival and attended each service is independent of all previous. The theory of stochastic processes focuses on the study and modelling of systems that evolve over time, or space, according to a non-deterministic law, queue management system random character. The usual way to describe the evolution of the system is through inheritance or collections of random variables.

Thus, we can study how a random variable evolve over time. For example, the number of queue management price people waiting at a window of a bank in a moment of time t; the price of the shares of a company over a year. The basic idea is to first identify a stochastic process with a sequence of queue management system random variables where the subscript indicates the point in time (or space) corresponding.