Vi

~ <7'

J J_ ~
c · -
o_
t
-..,
r --
.(
~p
-i&-
V'\ \ 'w ~

r ~ Lil - "i::::,-..

~ ~
f- ~
~

r --
--1
~ ~

1 \:;

t l
......
>--:- -
0
t
"'-
(I

;
-
..,J

~
~
'i-
()

~ ~
~ -
~ f ~
-
i C'- r
4---
'
tQ_r-~
t
L ~ ~
:t,
~ -

~ ~ ~ - \)'""- - ~
E

J' t t
'1:'
C.

&. t
1 1

t
C

f
~

r C\'
 'I
'

I\
n

(_) .

b
IS
I
,--~

It
J -.

~a-. ~ ~ .
' ' ""zaiei, -
R~ o;,•,.lt., t H,..._ 1~
s
c •-..co Y:. •tr,."h__
c, \I\
1
( \I\
~ f l tl Q..., ~
f LI: I< . . .~. "
<I, W>
( <>t\\ t_..}• /:'(,,_~ ,{.I·•¼.~

c~
' . t,.• 1 t\'''-.Ai I'\\ ,;l'l "'f- ..,...,.
, _. ,\'v~~i'\t'
l ~
\) ..- ": '-lt,tQ ci..~ ""N "'4

A {_~ C .t) ..- .--·-r.

~ ,''':"-~___ V--· ,'\-_l~
.._ ~...
-·-.. ,.._

l 'f
I 0 0 0

0 l.
2..

0
(

Q
(J
(h C ( , ""-J\.,-~
j, u.. t
Q
t ~l 7}_
I
\
I.
j
)_ I s i
j
 .J Vi
- r;-- r:i----
~ .;..
i () ,...s: -

f } f f ~

-
?"
b 't
0_ ~
c:.

C
;s

-
r} C C

r 'l""
~

l
7-'
~ 'i-
l 1. r /;

at
~
t J' ? 1 J
~
t
J,.t ~ -
..:s
~
~ ~ ~

f f t 0 0 0

$-- I __r
)
1
(\)
(\"

----r--
~
ftt ~b-
 ·- - · - -- -- - Jlllll'f
" ~
. . '

--- --
A D

J
r -I , I 0 0
2-
'1

I I 0 o• 0

s I 0 a , o
I _· -

0
r
I I
~

!
..

-07 2-
I

• l
I
2-
.
0 0
.__

Lo _j :2--

---
_S t~5

l-L_ ~
~'M'\_ (:- ht2_

OJ1~
evhove

,:&
(:-~

'
I Y\
~"n\
~Yl~

o-{ I

/)1
t-~

~
~JV\ - ~4_ fle_ Pcuut- ~~93
F<V? T
,

Ct1 oJ 2- ,r '
I--!:,
(!/
I~

c/
!!J J? M fc ~aup
F- <0-'1 1 I~
0/ I,I s) 4 JL I~
'
(11/ 2-)
,..

p wt- .f aY\ _.h-6 e,J~

- Qo_ e , / ~ I
')"I\ -
'Y"\
L::.. 2- biP * 2 ~ w§) '.-0 - , 'y\c) . ~ /'L0 w~
P~ I
b ~ J:>, ·~ "Y'l c:> . (ocu !)
Y\ - fµ
::i ::::.. ?_ .b •P_J x- 7- ( 6Jum 0
e-:- r "'Y\ ~
ry\0 , a-{ uJum~
 Rank Order Clustering

b Kings in the
. . f: . t 1 It was introduced y . .
It 1s an algorithm found 111 the cell manu actunng sys en · mputmg binary
t ation of cluster study by co
form of machine-group parts. It uses the au om
weights from a machine part matrix.
. . i ht which
· 11 with the help of binary we g
It orders the parts of the machine in cells automattca Y lgorithm which
. I h . r ation of computer a
would structure and compute the matnx. t as imp ic
would solve the problems of clustering.

Steps:
\ . . . ht in decimal for each
I I. Assign the binary weights with its help determ111at10n of the weig
I
row and column; represented as Wi and Wi
2. ReaiTange the rows in the order of descending.

3. Repeat steps 1 and 2 for every column. And the reiterate from step.

. h · t that the elements cannot be

4. The procedure has to be repeated till there reac es a pom .
further changed from their positions.

Some issues:

• The repeated oscillations indicate that the machine be replicated .

• The finished clusters have presence of void and outliers .

• The already existing algoritluns are used to convert the already existing routes for
reorganization.

Production Flow Analysis (PFA): To group machin_~s, part routings must be known. Section
this presents a method for clustering part operations onto specific machines to provide this
routing information. The basic idea is:

✓ • identify items that are made with the same processes / the same equipment • These parts are
assembled into a part family • Can be grouped into a cell to minimize material handling
requirements.

The clustering methods can be classified into:

✓• Part family grouping: Form part families and then group machines into cells • Machine
grouping: Form machine cells based upon ~imilarities in part routing and then allocate parts
t~ s • Machine-part grouping: Form part families and machine cells simulta~ ly.
p

'
Product·Io_~ fl ow anajysis
-------
In operation -- - -
s management and industrial en ine .
methods which share th f . g enng , production flow analysis refers to
e O11 owing characteristics:

Classification of machines

2. Technological cycles information control

3. Generating a binary prod t . . .
. uc -machines matrix (1 if a given product requires processing in
a given machine, O otherwise)

Methods differ on ho th . .
. . . w ey group together machines with products. These play an important role
in designing manufacturing cells.

Rank Order Clustering[edit]

Given a binary product-machines n-by-m matrix , Rank Order Clustering 111 is an algorithm
characterized by the following steps:

1. For each row i compute the number

2. Order rows according to descending numbers previously computed

3. For each column p compute the number

4. Order columns according to descending numbers previously computed
5. If on steps 2 and 4 no reordering happened go to step 6, otherwise go to step 1
6. Stop

Although Rank Order Clustering is one of the widely used production flow algorithms , there are
some limitations to this method such as lack of consideration of _real-world manufacturing data
during clustering 121 and if the initial matrix is rearranged, then the resulting product-machine
matrix would be different. To overcome these drawbacks, a robust Modified Rank Order
Clustering algorithm was proposed by Nagdev Amruthnath 131 in 2016 121 .