SINGLE SERVER SINGLE QUEUE

SYSTEM
TWO SERVER TWO QUEUE SYSTEM

This system is basically known as queuing problem.

We will perform first single server single queue

We will perform tow servers two queue.

In this thing we need entitites, servers, queues,

Entities represents number of customers coming to use system

Servers will represent number of services which system will be providing. Here we will first
perform n server and n entities then we will perform 1 server and 1 entitiy
PROBLEM
There is a shop which is providing you a single service. and
that service is check out . custmers arrive in time span of 1-8
mins and their probability is 1/8=0.125.
Also the service time for each customer is 1-6 minutes
means every customer either spends 1 min or max of 6
minutes in system.
Their probability is also 1/6.
ALGORITHM
INterarrival time distribution table- Let say customer 1 is coming at 7 am
and customer 2 is coming at 7:30 am. And the inter arrival time between
these custimers will be the difference of time .
On the basis of this interarrival time we will be computing arrival time.
Initial cond. Is that cutomer 1 is arriving at time=0.
We know that customer 1 is arriving at 0 time and customer 2 Is arriving at
5 mins then arrival time will be 0+5=5 mins similarly for customer 3 and
so on.
Customer Probability of Cumulative Random digit
Arriving time occurrence probablilty assignment( Rang
e)

1 1/8=0.125 0.125 0-125

2 0.125 0.250 126-250
3 0.125 0.375 127-375
4 0.125 0.500 376-500
5 0.125 0.625 501-625
6 0.125 0.750 626-750
7 0.125 0.875 751-875
8 0.125 1.000 876-1000
Customer No Random digits
for arrival time
1 ----
2 913
3 727
4 15
5 948
6 309
7 922
8 753
Inter arrival time Arrival time
---- 0
8 0+8=8
6 8+6=14
1 15
8 23
3 26
8 34
7 41
Customer Service Probability of Cumulative Random number
Time occurrence probability assignment
(Range)

1 1/6=0.16 0.16 0-16

2 0.16 0.32 17-32

3 0.16 0.48 33-48

4 0.16 0.64 49-64

5 0.16 0.80 65-80

6 0.16 0.96 81-96

Service time table

Customer num Randim digits Service time
1 84 6
2 10 1
3 74 5
4 53 4
5 17 1
6 79 5
7 91 6
8 67 5
Custome Arrival Service Time Time Waiting Time Idle
r no. Time Time service service time spen in time of
bEgin ends system system
1 0 6 0 6 0 6 0
2 0+8=8 1 8 8+1=9 0 9-8=1 2
3 8+6=14 5 14 14+5=1 0 19- 5
9 14=5
4 15 4 19 19+4=2 4 23- 0
3 19+4=8
5 23 2 23 25 0 2 0
6 26 5 26 31 0 5 1
7 34 6 34 40 0 6 3
8 41 5 41 46 0 5 1
INTER ARRIVAL TIME DISTRIBUTION
TABLE
This is the simulation Distribution table for 8 customers in queuing model.