In Queuing Theory, statistical pattern by which customers arrive over a period of time, follows
In the study of Queuing Theory, understanding how customers arrive at a service system is crucial for analyzing waiting times, queue lengths, and system efficiency. The pattern by which these customers arrive over a specific period is typically modeled using a statistical distribution.
When we talk about random events occurring independently over a fixed interval of time or space, the Poisson distribution is the standard model. In the context of queuing theory, customer arrivals are often assumed to fit this pattern.
Here's why the Poisson distribution is commonly used for modeling customer arrivals:
The Poisson distribution describes the probability of a specific number of events (customer arrivals) occurring in a fixed interval of time or space if these events occur with a known constant mean rate and independently of the time since the last event.
If $\lambda$ represents the average arrival rate (e.g., customers per hour), the probability of observing $k$ arrivals in a time interval of length $t$ is given by the Poisson probability mass function:
$$P(X=k) = \frac{e^{-\lambda t} (\lambda t)^k}{k!}$$
where:
This mathematical framework allows queuing models to predict the likelihood of different numbers of customers arriving within a given timeframe, which is fundamental to analyzing queue performance.
Therefore, the Poisson distribution is the most appropriate statistical pattern to describe how customers arrive over a period of time in standard queuing theory models.
| Distribution | Common Application in Queuing Theory | Key Characteristics |
|---|---|---|
| Poisson distribution | Number of customer arrivals in a fixed time interval | Models random events at a constant average rate; describes count data (0, 1, 2, ... events) |
| Exponential distribution | Time between customer arrivals (inter-arrival time); Service times | Continuous distribution; memoryless property (time until next event doesn't depend on time since last event) |
| Erlang distribution | Service times (sum of multiple exponential phases) | Generalization of exponential distribution; often used for service times that are not simply exponential |
| General (G) | Used when no specific distribution is assumed for arrivals (G/G/1) or service (M/G/1) | Represents any arbitrary distribution |
Beyond the customer arrival pattern, several other components define a queuing system in Queuing Theory:
Analyzing these components together using appropriate statistical models helps in evaluating performance measures like average queue length, average waiting time, and server utilization.
A transportation problem with m origins and n destinations becomes a trans-shipment problem with
Match List I with List II
List I | List II | ||
A. | Markovian property | I. | Rule of determining the order in which members of the queue are selected to begin service |
B. | Waiting time in system | II. | The time of next arrival is completely uninfluenced by when the last arrival occurred |
C. | Steady state condition | III. | The queueing is in after operating for some time with a fixed utilisation factor less than one |
D. | Queue discipline | IV. | Elapsed time that an individual customer spends in queue, both before service and during service |
Choose the correct answer from the options given below:
Customers arrive at a reception counter at an average interval rate of 10 minutes and the receptionist takes an average of 6 minutes for one customer. The average queue length is:
The first and foremost important feature for a project to be successful is:
Arrange the operations in production planning and control in correct sequence :
(i) Routing
(ii) Dispatching
(iii) Follow up
(iv) Scheduling
Choose the correct answer from the code given below: