Little's law is the relationship between
Waiting time and length of the queue in a queuing system
Little's Law is a fundamental theorem in queuing theory and operations management. It establishes a connection between the average number of items within a system and the average time each item spends in that system, provided the system is in a steady state (stable).
The mathematical expression for Little's Law is:
$$ L = \lambda W $$
Where:
Essentially, Little's Law states that the average inventory (or queue length) equals the average arrival rate multiplied by the average time spent in the system.
Let's evaluate each option based on the definition of Little's Law:
Little's Law fundamentally describes the relationship between the average number of entities in a stable system ($L$) and the average time they spend in that system ($W$), linked by the average arrival rate ($\lambda$). This principle is most directly applicable to queuing systems, linking metrics like average queue length and average waiting time.
The probability of getting a total of 7 on two dice thrown together is:
If moment generating function of continuous random variable X is \(\frac{λ}{λ-t}\) t < λ, then E(X 3) equals to:
If moment generating function of discrete random variable X is (q + pe t) n, then E(X 2) equal to
If A and B are mutually exclusive events such that P(A) P(B) > 0, then which option is correct?
Two random variables X and Y are said to be independent if: