06Lecture-Ch18

06Lecture-Ch18 - ENGR3300U Integrated Manufacturing Systems...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Lecture 06 Chapter 18 – SLC, Arranging Machines in Cell Today’s lecture: Single Link Cluster Analysis – not in book Hollier methods I and II – Chap 18 Machine cell layouts – Chap 18 1. Single Link Cluster Analysis Given machine-part incidence matrix, want to determine which machines belong to which cell and which parts will be produced by which cell. SLC is a similarity-based clustering algorithm. Idea is to locate machines with high interaction in same group. Steps (1) Compute similarity coefficients s ij between 2 machines (2) Form machine cells by grouping machines with high similarity. Add machines to existing groups when an unassigned machine has a similarity coefficient with, at least, one of the machines in the group. This step is done using a Dendogram. (3) Form part families by assigning parts to cells where they visit the max # of machines Similarity Coefficient ( Askin’s Definition ) = = j ij i ij ij n n n n MAX s , Note: s ij = s ji and 0 ≤ s ij ≤ 1 n i = # of parts that visit machine i n j = # of parts that visit machine j n ij = # of parts that visit both machines i and j Example 1 Apply the SLC algorithm to the following 4 machines, 5 parts incidence matrix. Parts
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 10

06Lecture-Ch18 - ENGR3300U Integrated Manufacturing Systems...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online