<
Previous
|
Next
|
Contents
>
Self-Service Queuing System
The best queue happens when we can let the customers behave as the servers. This type of self-service queuing system produces the minimum queue length and minimum delay.
The arrival distribution of customers follows Poisson distribution and the distribution for service time follows Exponential distribution.
Use the Self-Service queuing calculator below to experiment and to give you the best solution to solve queuing problem.
The M/M/∞ queuing calculator is based on the following formulation:
Input:
- Arrival rate (number of customers/unit time) \( \lambda \)
- Service rate (number of customers/unit time) \( \mu \)
Output:
- \( U \) = Utilization factor = percentage of the time that all servers are busy, \( U= \frac{L-L_{q}}{s} \)
- \( P_{0} \) = probability that there are no customers in the system, \( P_{0} = e^{-\rho} \)
- \( P_{n} \) = probability that there are n customers in the system, \( P_{n}= \frac{e^{-\rho} \rho^{n}}{n!} \)
- \( W_{q} \) = average time a customer spends in waiting line waiting for service, \( W_{q} = 0 \)
- \( W \) = average time a customer spends in the system (in waiting line and being served), \( W= \frac{1}{\mu} \)
- \( L_{q} \) = average number of customer in waiting line for service, \( L_{q} = 0 \)
- \( L \) = average number of customer in the system (in waiting line and being served), \( L = \rho \)
<
Previous
|
Next
|
Contents
>
Do you have queuing problem? Consult your expert for a solution here
These tutorial is copyrighted .
Preferable reference for this tutorial is
Teknomo, Kardi. (2014) Queuing Theory Tutorial
http://people.revoledu.com/kardi/tutorial/Queuing/