Lawrence Masicat

Kimzy Bagayas

1. A school of 10,000 students set certain days for registration and tuition fee
payment (serial servers to get registration form, check all delayed payments, pay
at the cashier and get certificate of payment). One working day is from 8:00 am
to 5:00 pm with lunch hour set at 12:00 nn to 1:00 pm. Each parent needs about
36 second to be served by all the serial servers. How many days is needed to
register all students?

-12 days and half day is needed to register all the students by their parents this
obtained by dividing the number of students in 10,000 divide by 800 total of 12.5 days
and they are divided by 100 per hour, and workers will work 8hours per day so in one
day 800 students are required to be registered so that the can properly registered.
 60 mins * 60 secs = 3600 secs
3600 / 36 = 100 parents per hour
100 * 8 hours = 800 parents pre working

lambda 10000 lambda = arrival rate

mu 800 mu = service rate
s = number of
servers
Lq = average number in the
queue
Ls = average number in the
system
Wq = average wait in the queue
Ws = average wait in the system
P(0) = probability of zero customers in the
system
P(delay) = probability that an arriving customer has to wait

Outputs:
Utilizatio
s Lq Ls Wq Ws P(0) P(delay) n
0  
1 infinity infinity infinity infinity 0.0000 1.0000 1.0000
2 infinity infinity infinity infinity 0.0000 1.0000 1.0000
3 infinity infinity infinity infinity 0.0000 1.0000 1.0000
 4 infinity infinity infinity infinity 0.0000 1.0000 1.0000
5 infinity infinity infinity infinity 0.0000 1.0000 1.0000
6 infinity infinity infinity infinity 0.0000 1.0000 1.0000
7 infinity infinity infinity infinity 0.0000 1.0000 1.0000
8 infinity infinity infinity infinity 0.0000 1.0000 1.0000
9 infinity infinity infinity infinity 0.0000 1.0000 1.0000
10 infinity infinity infinity infinity 0.0000 1.0000 1.0000
11 infinity infinity infinity infinity 0.0000 1.0000 1.0000
12 infinity infinity infinity infinity 0.0000 1.0000 1.0000
13 21.1263 33.6263 0.0021 0.0034 0.0000 0.8451 0.9615
14 4.9249 17.4249 0.0005 0.0017 0.0000 0.5910 0.8929
15 2.0065 14.5065 0.0002 0.0015 0.0000 0.4013 0.8333
16 0.9432 13.4432 0.0001 0.0013 0.0000 0.2641 0.7813
17 0.4672 12.9672 0.0000 0.0013 0.0000 0.1682 0.7353
18 0.2353 12.7353 0.0000 0.0013 0.0000 0.1035 0.6944
19 0.1183 12.6183 0.0000 0.0013 0.0000 0.0615 0.6579
20 0.0588 12.5588 0.0000 0.0013 0.0000 0.0353 0.6250
21 0.0287 12.5287 0.0000 0.0013 0.0000 0.0195 0.5952
22 0.0137 12.5137 0.0000 0.0013 0.0000 0.0104 0.5682
23 0.0064 12.5064 0.0000 0.0013 0.0000 0.0053 0.5435
24 0.0029 12.5029 0.0000 0.0013 0.0000 0.0027 0.5208
25 0.0013 12.5013 0.0000 0.0013 0.0000 0.0013 0.5000

Chart Title
30 1.2000

25 1.0000

20 0.8000

15 0.6000

10 0.4000

5 0.2000

0 0.0000
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26

Outputs: s Outputs: Lq Outputs: Ls Outputs: Wq

Outputs: Ws Outputs: P(0) Outputs: P(delay) Outputs: Utilization
2. During morning peak hour (6:00 - 7:00), approximately 4,500 cars will enter a favorite
school to drop their children to elementary school. Each drop point requires
approximately 60 seconds (including maneuver time and bring down the heavy
luggage). Each car requires about 6 meters to stop and maneuver. How long should the
minimum dropping line be?

-It should be 450 meters long is the minimum distance for each car, so that they can maintain the safety
of children and everyone and have enough time to do all they needed to do for dropping their children.

4500 cars * 1 minute /60 minute = 75

75 * 6 meters = 450 meters

Inputs: Definitions of terms:

lambda 4500 lambda = arrival rate
mu 450 mu = service rate
s = number of servers
Lq = average number in the queue
Ls = average number in the system
Wq = average wait in the queue
Ws = average wait in the system
P(0) = probability of zero customers in the system
P(delay) = probability that an arriving customer has to wait

Outputs:
Utilizatio
s Lq Ls Wq Ws P(0) P(delay) n
0  
1 infinity infinity infinity infinity 0.0000 1.0000 1.0000
2 infinity infinity infinity infinity 0.0000 1.0000 1.0000
3 infinity infinity infinity infinity 0.0000 1.0000 1.0000
4 infinity infinity infinity infinity 0.0000 1.0000 1.0000
5 infinity infinity infinity infinity 0.0000 1.0000 1.0000
6 infinity infinity infinity infinity 0.0000 1.0000 1.0000
7 infinity infinity infinity infinity 0.0000 1.0000 1.0000
8 infinity infinity infinity infinity 0.0000 1.0000 1.0000
9 infinity infinity infinity infinity 0.0000 1.0000 1.0000
10 infinity infinity infinity infinity 0.0000 1.0000 1.0000
0.003
11 6.8212 16.8212 0.0015 7 0.0000 0.6821 0.9091
0.002
12 2.2469 12.2469 0.0005 7 0.0000 0.4494 0.8333
13 0.9509 10.9509 0.0002 0.002 0.0000 0.2853 0.7692
 4
0.002
14 0.4353 10.4353 0.0001 3 0.0000 0.1741 0.7143
0.002
15 0.2041 10.2041 0.0000 3 0.0000 0.1020 0.6667
0.002
16 0.0956 10.0956 0.0000 2 0.0000 0.0573 0.6250
0.002
17 0.0441 10.0441 0.0000 2 0.0000 0.0309 0.5882
0.002
18 0.0199 10.0199 0.0000 2 0.0000 0.0159 0.5556
0.002
19 0.0087 10.0087 0.0000 2 0.0000 0.0079 0.5263
0.002
20 0.0037 10.0037 0.0000 2 0.0000 0.0037 0.5000
0.002
21 0.0015 10.0015 0.0000 2 0.0000 0.0017 0.4762
0.002
22 0.0006 10.0006 0.0000 2 0.0000 0.0007 0.4545
0.002
23 0.0002 10.0002 0.0000 2 0.0000 0.0003 0.4348
0.002
24 0.0001 10.0001 0.0000 2 0.0000 0.0001 0.4167
0.002
25 0.0000 10.0000 0.0000 2 0.0000 0.0000 0.4000
 Chart Title
30 1.2000

25 1.0000

20 0.8000

15 0.6000

10 0.4000

5 0.2000

0 0.0000
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26

Outputs: s Outputs: Lq Outputs: Ls Outputs: Wq

Outputs: Ws Outputs: P(0) Outputs: P(delay) Outputs: Utilization