[동시공학]Group Technology Problem (GT)

소개

A+받았던거예요..그냥 넘기기 아깝고..공유하고 싶어서요..

목차

Perform the following heuristic approaches to the given matrix:

Solve the machine-part incidence matrix (1) by:

1. Following algorithms :
ⅰ. Single linkage cluster algorithm (SLCA)
ⅱ. Rank order algorithm ( ROC )
ⅲ. Direct cluster algorithm ( DCA )
ⅳ. Bond energy algorithm (BEA)

2. Define and find the bottleneck elements, and suggest the way how to handle with those elements.

3. Find out the grouping efficiency of each case.

본문내용

․ Bond energy algorithm(BEA)

n An interchange clustering algorithm to form a block diagonal machine-part incidence matrix such that the "measure of effectiveness" (ME) is maximized

where aij is the (i,j)th element of the matrix

n Bond Energy Algorithm (BEA)
q Introduced in 1972 (McCormick, Schweitzer, White)
q Approximate solution
q Still widely used


Steps of BEA

n Step 1: Set j=1, select one column arbitrarily and place it in column 1`s position
n Step 2: Place each of the remaining columns at the (j+1)th position and compute their contribution to ME
n Step 3: Select the column with highest contribution to ME and place it in (j+1)th position
n Step 4: j=j+1; repeat steps 1,2,3
n Step 5: Repeat steps 1,2,3,4 for all rows

n Limitation of BEA: due to arbitrariness; selection of initial column can influence the quality of the solution
n An interchange clustering algorithm to form a block diagonal
machine-part incidence matrix such that the "measure of effectiveness"
(ME) is maximized


where aij is the (i,j)th element of the matrix

참고자료

· 없음