NATIONAL UNIVERSITY OF SCIENCE AND TECHNOLOGY

FACULTY OF ENGINEERING
DEPARTMENT OF INDUSTRIAL AND MANUFACTURING
ENGINEERING

NAME: NCUBE LANGALENKOSI M

STUDENT NUMBER: N02219827H

COURSE: MANUFACTURING SYSTEMS

COURSE CODE: EIE 3112

LECTURER: ENG T MUHLA

DUE DATE: 11 SEPTEMBER 2024

INDIVIDUAL ASSIGNMENT
 1. Advantages of using rank order clustering over other clustering
algorithms:
 Flexibility: It can handle binary data easily, making it suitable for
problems involving machine-part matrices in manufacturing
systems.
 Robustness to Noise and Outliers
 Enhanced Performance with High-Dimensional Data
 Simplicity: It is simple to implement and computationally less
intensive compared to more complex algorithms.
 Direct machine-part grouping: It focuses specifically on grouping
machines and parts directly based on incidence matrices, which is
useful for cellular manufacturing.

Find the logical part families and machine groups using the Rank Order
clustering Algorithm
Machines Parts
1 2 3 4 5 6 7 8 9 10
M1 1 1 1 1 1 1 1 1 1
M2 1 1 1 1 1
M3 1 1 1 1
M4 1 1 1 1 1 1
M5 1 1 1 1 1 1 1 1

Solution
  Sorting Rows
Machine Parts
s
1 2 3 4 5 6 7 8 9 1 Decimal Ran
0 k
Equivalen
t
M1 1 1 1 1 1 1 1 1 1 1007 2
M2 1 1 1 1 1 451 5
M3 1 1 1 1 568 3
M4 1 1 1 1 1 1 455 4
M5 1 1 1 1 1 1 1 1 1020 1
29 28 27 26 25 24 23 22 21 20
51 25 12 6 3 1 8 4 2 1
2 6 8 4 2 6

After ranking the decimal equivalent starting with the highest value, the new
order is M5; M1; M3; M4; M2 respectively
 Sorting columns
Machines Parts
1 2 3 4 5 6 7 8 9 10

M5 1 1 1 1 1 1 1 1 24 16
M1 1 1 1 1 1 1 1 1 1 23 8
M3 1 1 1 1 22 4
M4 1 1 1 1 1 1 21 2
M2 1 1 1 1 1 20 1
Decimal 28 27 27 27 28 20 28 26 11 11
Equivalen
t
Rank 1 4 5 6 2 8 3 7 9 10
After rearranging the columns, the table becomes:

Machines Parts
1 5 7 2 3 4 8 6 9 10

M5 1 1 1 1 1 1 1 1
M1 1 1 1 1 1 1 1 1 1
M3 1 1 1 1
M4 1 1 1 1 1 1
M2 1 1 1 1 1
Decimal 28 28 28 27 27 27 26 20 11 11
Equivalen
t

 Sorting rows by calculating the decimal equivalent again

Machine Parts
s
1 5 7 2 3 4 8 6 9 10 Decimal Rank
Equivalent
M5 1 1 1 1 1 1 1 1 1020 1
M1 1 1 1 1 1 1 1 1 1 1019 2
M3 1 1 1 1 900 3
M4 1 1 1 1 1 1 123 4
M2 1 1 1 1 1 115 5
29 28 27 26 25 24 23 22 21 20
there is no change in the sorted rows which implies that the algorithm stops here
giving the final clustering table as:
Machine Parts
 s
1 5 7 2 3 4 8 6 9 10

M5 1 1 1 1 1 1 1 1
M1 1 1 1 1 1 1 1 1 1
M3 1 1 1 1
M4 1 1 1 1 1 1
M2 1 1 1 1 1
29 28 27 26 25 24 23 22 21 20

Therefore, the groups are:

Group Machine Parts
1 M5; M1 1; 5; 7; 2; 3; 4; 8
2 M3 6
3 M4; M2 9; 10

QUESTION 2

Task Immediate predecessor Task time (minutes)

A - 12
B A 6
C B 6
D B 2
E B 2
F B 12
G C, D 7
H G 5
 I E 1
J F, I 4
K H, J 6
L K 7

Given Data
Desired Output = 140 Computers/ week
1 Shift/ day where a shift is 7 hours for 5 days/ week

Solution
a) Precedence diagram

6
7 5

C H
G

2
1
6
12 6 D
I K
A B
2 4
7
E
J
L

12

Task RPW New order

A 70 1
B 58 2
C 31 3
D 27 5
E 20 7
F 29 4
G 25 6
H 18 8
I 18 9
J 17 10
K 13 11
L 7 12

Workstation Task Task time Workstation Idle Time

time
1 A 12 12 3
2 B 6 12 3
C 6
3 F 12 14 1
D 2
4 G 7 14 1
E 2
H 5
I 1 11 4
5 J 4
K 6
 6 L 7 7 8
TOTAL 70 70 20

b) Calculate the Cycle time

Total Time Available 7 x 5 x 60
Cycle time ¿ Desired output
=
140

= 15 minutes
c) Calculate the theoretical number of work stations
Total Task time 70
= Cycle time
= 15

= 4.67
= 5 workstations
d) Calculate Lead Time
= Tc x n
= 15 x 6
= 90 minutes
e) Efficiency
total task time 70
= lead time
= 90

= 0,38 = 77,8%