Scribd
Upload
53 views1 page

Random Fashion. in Fact There Are Many More Arrival Patterns Are Available But For Simplicity

The document discusses characteristics of input to a queuing system. It describes how customers can arrive individually or in batches in a random pattern. The key characteristics of input include the nature of arrivals, size of arrivals, and inter-arrival times. For simplicity, the document focuses on queuing systems where arrivals follow a Poisson or completely random fashion with exponentially distributed inter-arrival times. Service times can be constant or randomly distributed according to different possible distributions.

Uploaded by

CalinghenKeshaven
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
53 views1 page

Random Fashion. in Fact There Are Many More Arrival Patterns Are Available But For Simplicity

The document discusses characteristics of input to a queuing system. It describes how customers can arrive individually or in batches in a random pattern. The key characteristics of input include the nature of arrivals, size of arrivals, and inter-arrival times. For simplicity, the document focuses on queuing systems where arrivals follow a Poisson or completely random fashion with exponentially distributed inter-arrival times. Service times can be constant or randomly distributed according to different possible distributions.

Uploaded by

CalinghenKeshaven
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Input to the queuing system refers to the pattern of arrival of customers at the service facility.

We

can see at ticket counters or near petrol bunks or any such service facility that the customer arrives

randomly individually or in batches. The input process is described by the following characteristics
(as

shown in the figure 9.4) nature of arrivals, capacity of the system and behavior of the customers.

(a) Size of arrivals: The size of arrivals to the service system is greatly depends on the nature

of size of the population, which may be infinite or finite. The arrival pattern can be more

clearly described in terms of probabilities and consequently the probability distribution for

inter- arrival times i.e. the time between two successive arrivals or the distribution of number

of customers arriving in unit time must be defined. In our discussion in this chapter, it is

dealt with those queuing system in which the customers arrive in Poisson or Completely

random fashion. In fact there are many more arrival patterns are available but for simplicity,

only Poisson arrivals are considered.

(b) Inter-arrival time: The period between the arrival of individual customers may be constant

or may be scattered in some distribution fashion. Most queuing models assume that the

some inter-arrival time distraction applies for all customers throughout the period of study.

It is true that in most situations that service time is a random variable with the same distribution

for all arrivals, but cases occur where there are clearly two or more classes of customers

such as a machine waiting for repair with a different service time distribution. Service time

may be constant or random variable. In this chapter mostly distribution of service time,

which are important, are considered and they are Negative exponential distribution and

Erlang or Gamma distribution. The most convenient way is to designate some random

variables corresponding to the time between arrivals. In general the arrivals follow Poisson

distribution when the total number of arrivals during any given time interval of the number of

You might also like