Chapter 3 (cont): Group technology algorithm

Lê Đức Đạo, Phd

Industrial System Enginerring Department
Faculty of Mechanical Engineering
Ho Chi Minh City University Of Science and Technology
Phone: 0937286746
Email: ducdao92@gmail.com
 RANK ORDER CLUSTERING OR BINARY
ORDERING ALGORITHM (GIẢI THUẬT SẮP
XẾP THEO TRỌNG SỐ NHỊ PHÂN)

 Step 1: Assign binary weight for column and calculate a decimal weight for each row


2048 1024 512 256 128 64 32 16 8 4 2 0

Step 2: calculate the decimal weight of each row

Step 3: ranking decimal weight of rows by descending number
Step 4: calculate the decimal weight of each row & ranking decimal weight of column by
descending number
Step 5: Make loop until optimal clustering generated
RANK ORDER CLUSTERING
OR BINARY ORDERING
ALGORITHM
Step 1-2
Machine

Part

Machine
Step 3-4

Part
RANK ORDER CLUSTERING
OR BINARY ORDERING
ALGORITHM
Step 1-2
Machine

Part

Machine
Step 3-4

Part

4
EXERCISES OF CIA OF ROC OR
BOC
 EXAMPLE OF CLUSTER IDENTIFICATION
ALGORITHM – CIA (GIẢI THUẬT CHỈ ĐỊNH
NHÓM)

• The algorithm begins by masking all columns that have an entry of 1 in any row (selected randomly) then all rows
that have an entry of 1 in these columns are masked. This process repeated until all intersecting columns and rows
are masked
• These masked columns and row are placed in a block and removed from the matrix
• Then the process off masking starts again and another block is identified
• This will continue until all the entries in the matrix are assigned in blocks and all separable blocks are identified
 CLUSTER IDENTIFICATION ALGORITHM -
CIA
• masking all columns that have an entry of 1 in any row (selected randomly)

7
CLUSTER IDENTIFICATION ALGORITHM -
CIA
then all rows that have an entry of 1 in these columns are masked.

8
CLUSTER IDENTIFICATION ALGORITHM -
CIA
This process repeated until all intersecting columns and
rows are masked

9
CLUSTER IDENTIFICATION ALGORITHM -
CIA
This process repeated until all intersecting columns and
rows are masked

10
CLUSTER IDENTIFICATION ALGORITHM -
CIA
• These masked columns and row are placed in a
block and removed from the matrix

11
CLUSTER IDENTIFICATION ALGORITHM -
CIA
• Then the process of masking starts again and
another block is identified

12
CLUSTER IDENTIFICATION
ALGORITHM - CIA
• This will continue until all the entries in the matrix
are assigned in blocks and all separable blocks are
identified

13
CLUSTER IDENTIFICATION ALGORITHM -
CIA

Block 1

Block 2

14
Block 3
EXERCISES OF CIA
GIẢI THUẬT PHÂN TÍCH CHI
PHÍ
COST ANALYSIS ALGORITHM -
CAA
 Masking the columns containing highest cost
 In this line, draw row lines consisting 1
 Identifying the group of part masked by only row lines
• Applying CIA in each part (begin with part having the highest cost)
• These masked columns and row are placed in a block and removed from the matrix
 This will continue until all the entries in the matrix are assigned in blocks and all separable
blocks are identified
CAA
Masking the columns containing highest cost

Cost 17
CAA
 In this line, draw row lines consisting 1

18
CAA
 Identifying the group of part masked by only row lines

19
CAA
• Applying CIA in each part (begin with part having the highest cost)- part 7

 P7 is accepted

20
CAA
• Applying CIA in each part part 2

 P2 is accepted

21
CAA
VÍ DỤ
• Applying CIA in each part part 4

 P4 is rejected

22
CAA
VÍ DỤ
• Applying CIA in each part (part 6)

 P6 is rejected

23
CAA
VÍ DỤ
• Applying CIA in each part (part 1)

 P1 is rejected

24
CAA
VÍ DỤ
• Applying CIA in each part (part 9)

 P9 is rejected

25
CAA
VÍ DỤ
• These masked columns and row are placed in a block and removed from the matrix

26
 CAA
•These order group are formed in the blocks and cannot be mutually separated

27
CAA
VÍ DỤ
 Kết quả sắp xếp: Rejected (outsoruce)

28
EXERCISES OF CAA
EXERCISES OF DCA