1.

Given data :
From A B C d E F
A   16 25 73 12 54
B     96 23 31 45
C       41 22 20
D         19 57
E           48
a. Now, arrange the above trips between processesin descending order :
 From : B to C -> 96 trips
A to D -> 23 trips
D to F -> 57 trips
A to F -> 54 trips
E to F -> 48 trips
B to F -> 45 trips
C to D -> 41 trips
B to E -> 31 trips
A to C -> 25 trips
B to D -> 23 trips
C to E -> 22 trips
D to E -> 19 trips
A to B -> 18 trip
A to E -> 12 trips
 From the above sequence
- “B & C” should be adjacent
- “A & D” have heaviest traffict & they preferably be adjacent to each other.
- “F” should be adjacent to “D” since with 57 trips, the traffic third biggest
- Though “A & C” have a traffic of “54” trips, they can’t be adjacent to each
other, since “D” will come in between.
- “E & F” with 48 trips can be close to each other and soon.
 So, by trail and error one of the layout satisfies most of above conditions.
 So, by the trail & error one of the layouts satisfy most of above conditions.

B C A D F E

40 feet 40
40 40 40 feet
 Here we need to calculate the total distance of tips between processes in a matrix, as
shown below

Tips Between Processes

A B C D E F
A 18 25 13 12 54
 B 96 23 31 45
C 41 22 20
D 19 57
E 48
F

 The inter station distance matrix:

Distance between processes
A B C D E F
A 80 40 40 120 80
B 80 40 120 200 160
C 40 40 80 160 120
D 40 120 80 80 40
E 120 200 160 80 40
F 80 160 120 40 40
 The total distance travelled is in matrix:

A B C D E F
A 0 1440 1000 2920 1440 4320 11,120
B 0 0 3840 2760 6200 7200 20,000
C 0 0 0 3280 7520 2400 9200
D 0 0 0 0 1520 2280 3800
E 0 0 0 0 0 1920 1920
F 0 0 0 0 0 0 0
Total distance travelled: 46,040

b. Consider, layout which minimizes the total traffic

n n
Formula , minimum of ∑ ❑ ∑ ❑ x ij x T ij
i=1 j=1
Where m = total no of process areas.
i,j = individual process
T ij = no of trips moved between departement I and departement j
x ij = distrance between departement I and departement j.

 So, by layout good solutions, which satisfy the conditions of shown below

A D F C B E

40 feet 40 40 40 40 feet
  The inter-process distance matrix

A B C D E F
A 160 120 40 200 80
B 160 40 120 40 80
C 120 40 80 80 40
D 40 120 80 160 40
E 200 40 80 160 120
F 80 20 40 40 120

 The total distance travelled by multiplying the no of trips b/w processes & distance b/w
processes

A B C D E F
A 0 2880 3000 2920 240023 4320 15520
B 0 0 3840 2760 1240 3600 11440
C 0 0 0 3280 1760 800 5540
D 0 0 0 0 3040 2180 5320
E 0 0 0 0 0 5760 5760
F 0 0 0 0 0 0 0
Total 43760

The total distance travelled is 43,880 feet.

2.
a.
A B

E F
D

b.
total working
c. Cycle time =
output require per day
8 x 60 x 60
=
400
 = 72 second
Total time to complete = 50 + 36 + 26 + 22 + 70 + 30
= 234 sec
d. Minimum number of workstation
¿
= total time ¿ complote each element cycle time
234
= = 3,25 or 4
72
e. 72 sec 72 sec 72 sec 72 sec

50 sec 36 sec 22 sec 70 sec 36 sec 22 sec

A B E C F
D

234
f. Efficiency = = 0,8125 = 81,25%
288

3. Answer:
a. Cycle time is 4 minutes which is governed by stations 3 & 4.
60
b. Maximum output is: = 15 unita/hours.
4
c. Idle time per cycle : 1,0 + 0,5 + 0,0 + 1 + 1,5 + 0= 4 minutes.
20
d. Efficiency is : = 83,3%
24