SMS-Chapter 1-Able-Baker's Problem
SMS-Chapter 1-Able-Baker's Problem
SMS-Chapter 1-Able-Baker's Problem
Able-Baker’s Problem
STEPS:
A customer arrives at time k.
If both able and baker are free, then service goes to Able.
If Able is busy, service goes to Baker.
If both Able and Baker are busy, then customer waits for one
of them to be free.
TIME B/W 1 2 3 4
ARRIVAL
PROBABILITY 0.25 0.40 0.20 0.15
SERVICE 2 3 4 5
TIME
PROBABILITY 0.30 0.28 0.25 0.17
SERVICE 3 4 5 6
TIME
PROBABILITY 0.35 0.25 0.20 0.20
Random digits for service time: 95, 21, 51, 92, 89, 38
Solution:
1 - - 0 95 0 5 5 - - - 0
2 26 2 2 21 - - - 2 3 5 0
3 98 4 6 51 6 3 9 - - - 0
4 90 4 10 92 10 5 15 - - - 0
5 26 2 12 89 - - - 12 6 18 0
6 42 2 14 38 15 3 18 - - - 1
TIME B/W 1 2 3 4
ARRIVAL
PROBABILITY 0.25 0.40 0.20 0.15
SERVICE 2 3 4 5
TIME
PROBABILITY 0.30 0.28 0.25 0.17
SERVICE 3 4 5 6
TIME
PROBABILITY 0.35 0.25 0.20 0.20
Solution:
1 - - 0 59 0 4 4 - - - 0
2 74 3 3 48 - - - 3 4 7 0
3 50 2 5 86 5 5 10 - - - 0
4 03 1 6 35 - - - 7 3 10 1
5 31 2 8 12 10 2 12 - - - 2
6 21 1 9 3 - - - 10 3 13 1
7 09 1 10 57 12 3 15 - - - 2
8 09 1 11 73 - - - 13 5 18 2
9 23 1 12 07 15 2 17 - - - 3
10 50 2 14 14 17 2 19 - - - 3
11 97 4 18 19 - - - 18 3 21 0
12 39 2 20 55 20 3 23 - - - 0
13 46 2 22 90 - - - 22 6 28 0
14 09 1 23 57 23 3 26 - - - 0
15 58 2 25 60 26 4 30 - - - 1
16 55 2 27 76 - - - 28 5 33 1
17 13 1 28 77 30 4 34 - - - 2
18 31 2 30 06 - - - 33 3 36 3
19 60 2 32 60 34 4 38 - - - 2
20 13 1 33 82 - - - 36 6 42 3