CELLULAR MANUFACTURING. Definition Objectives of Cellular Manufacturing  To reduce WIP inventory  To shorten manufacturing lead times  To simplify.

Slides:



Advertisements
Similar presentations
SEL3053: Analyzing Geordie Lecture 13. Hierarchical cluster analysis 2 - cluster tree construction Lecture 12 introduced hierarchical cluster analysis,
Advertisements

Group Technology GT Job shop production System Batch production System
Clustering Clustering of data is a method by which large sets of data is grouped into clusters of smaller sets of similar data. The example below demonstrates.
Basic Gene Expression Data Analysis--Clustering
Clustering.
IENG 471 Facilities Planning
1 Transportation problem The transportation problem seeks the determination of a minimum cost transportation plan for a single commodity from a number.
Facility Design-Week6 Group Technology and Facility Layout
Cluster Analysis Measuring latent groups. Cluster Analysis - Discussion Definition Vocabulary Simple Procedure SPSS example ICPSR and hands on.
Image Indexing and Retrieval using Moment Invariants Imran Ahmad School of Computer Science University of Windsor – Canada.
ISEN 601 Location Logistics Dr. Gary M. Gaukler Fall 2011.
Microarray GEO – Microarray sets database
© C.Hicks, University of Newcastle IGLS02/1 A Genetic Algorithm Tool for Designing Manufacturing Facilities in the Capital Goods Industry Dr Christian.
Clustering… in General In vector space, clusters are vectors found within  of a cluster vector, with different techniques for determining the cluster.
Distance methods. UPGMA: similar to hierarchical clustering but not additive Neighbor-joining: more sophisticated and additive What is additivity?
3 Group Technology / Cellular Manufacturing
Transportation Models Transportation problem is about distribution of goods and services from several supply locations to several demand locations. Transportation.
From: McCune, B. & J. B. Grace Analysis of Ecological Communities. MjM Software Design, Gleneden Beach, Oregon
© C.Hicks, University of Newcastle C.F.Earl, Open University IDMME02/1 A Genetic Algorithm Tool for Designing Manufacturing Facilities in the Capital Goods.
Algorithms All pairs shortest path
Ch 18 Cellular Manufacturing
Ulf Schmitz, Pattern recognition - Clustering1 Bioinformatics Pattern recognition - Clustering Ulf Schmitz
Computer Integrated Manufacturing CIM
Group Technology and Facility Layout
Egekwu.3311 ISAT 331 Module 3: GROUP TECHNOLOGY AND PROCESS PLANNING.
COMP53311 Clustering Prepared by Raymond Wong Some parts of this notes are borrowed from LW Chan ’ s notes Presented by Raymond Wong
Hierarchical Clustering
Group Technology and Cellular Manufacturing Eng. Ahmed Al Afeefy
Chapter 7 Transportation, Assignment & Transshipment Problems
Eric C. Rouchka, University of Louisville SATCHMO: sequence alignment and tree construction using hidden Markov models Edgar, R.C. and Sjolander, K. Bioinformatics.
MODELING AND ANALYSIS OF MANUFACTURING SYSTEMS Session 12 MACHINE SETUP AND OPERATION SEQUENCING E. Gutierrez-Miravete Spring 2001.
Cluster analysis 포항공과대학교 산업공학과 확률통계연구실 이 재 현. POSTECH IE PASTACLUSTER ANALYSIS Definition Cluster analysis is a technigue used for combining observations.
Copyright © Cengage Learning. All rights reserved. CHAPTER 9 COUNTING AND PROBABILITY.
Gene expression analysis
CLUSTERING. Overview Definition of Clustering Existing clustering methods Clustering examples.
Slide 1 IEM 5303 Advanced Manufacturing Systems Design  2000 John W. Nazemetz Welcome/Opening Slide Welcome to Week 6 Discussion Experiment with New Format.
MODELING AND ANALYSIS OF MANUFACTURING SYSTEMS Session 8 CELLULAR MANUFACTURING GROUP TECHNOLOGY E. Gutierrez-Miravete Spring 2001.
Clustering C.Watters CS6403.
Clustering Algorithms Presented by Michael Smaili CS 157B Spring
Cellular Manufacturing Systems
Facilities design. Main Topics Discrete vs. Continuous Flow and Repetitive Manufacturing Process vs. Product-focused designs and the other currently used.
Analyzing Expression Data: Clustering and Stats Chapter 16.
Machine Learning Queens College Lecture 7: Clustering.
Unsupervised Learning
Tutorial 8 Gene expression analysis 1. How to interpret an expression matrix Expression data DBs - GEO Clustering –Hierarchical clustering –K-means clustering.
Computational Biology Group. Class prediction of tumor samples Supervised Clustering Detection of Subgroups in a Class.
Combining multiple learners Usman Roshan. Decision tree From Alpaydin, 2010.
Example Apply hierarchical clustering with d min to below data where c=3. Nearest neighbor clustering d min d max will form elongated clusters!
Gist 2.3 John H. Phan MIBLab Summer Workshop June 28th, 2006.
= the matrix for T relative to the standard basis is a basis for R 2. B is the matrix for T relative to To find B, complete:
Facility Layout Part b.
ESTIMATING WEIGHT Course: Special Topics in Remote Sensing & GIS Mirza Muhammad Waqar Contact: EXT:2257 RG712.
Multivariate statistical methods Cluster analysis.
MATRIX FORM OF PRIM’S ALGORITHM. This network may be described using a Distance Matrix.
Clustering Machine Learning Unsupervised Learning K-means Optimization objective Random initialization Determining Number of Clusters Hierarchical Clustering.
Group Technology and Cellular Manufacturing Eng. Ahmed Al Afeefy
UNIT II – GROUP TECHNOLOGY AND CAPP
LESSON 6-2 Inventory Costing
Trees, bagging, boosting, and stacking
COUNTING IN BINARY Binary weightings 0 x x x x 8
Organizing Production Equipment
Information Organization: Clustering
Part 3. Linear Programming
LESSON 6-2 Inventory Costing
Hierarchical and Ensemble Clustering
Hierarchical Clustering
COUNTING IN BINARY Binary weightings 0 x x x x 8
Departmental Planning
MACHINE GROUPING IN CELLULAR MANUFACTURING With Reduction Of Material Handling As the Objective 19/04/2013 lec # 25 & 26.
Clustering The process of grouping samples so that the samples are similar within each group.
Presentation transcript:

CELLULAR MANUFACTURING

Definition

Objectives of Cellular Manufacturing  To reduce WIP inventory  To shorten manufacturing lead times  To simplify production scheduling  To reduce set-up times  To provide minimum work part handling  To reduce process variation

12 Step 1:Assign binary weight and calculate a decimal weight for each row and column using the following formulas: n is the total number of rows

13 Step 2: Rank the rows in order of decreasing decimal weight values. Step 3: Repeat steps 1 and 2 for each column. Step 4: Continue preceding steps until there is no change in the position of each element in the row and the column.

14 EXAMPLE: Consider a problem of 5 machines and 10 parts. Try to group them by using Rank Order Clustering Algorithm. Machines M M M31111 M M Components Table 1

15 Machines Decimal equivalent M M M M M Binary weight Components Table 2

16 Binary weight Machines M M M M M Decimal equivalent Binary weight Components Table 3

17 Binary weight Machines Decimal equivalent 2424 M M M M M Decimal equivalent Binary weight Components Table 4

18 Similarity Coefficient-Based Approaches In similarity coefficient methods, the basis is to define a measure of similarity between machines, tools, design features, and so forth and then use it to form part families and machine groups.

19 Single-Linkage Cluster Analysis (SLCA): It is a hierarchical machine grouping method known as single-linkage cluster analysis using similarity coefficients between machines. The procedure is to construct a tree called a dendrogram.

20 The similarity coefficient between two machines is defined as the ratio of the number of parts visiting both machines and the number of parts visiting one of the two machines: where:X ijk = operation on part k performed both on machine i and j, Y ik = operation on part k performed on machine i, Z jk = operation on part k performed on machine j.

21 SLCA ALGORITHMS It helps in constructing dendrograms. A dendrogram is a pictorial representation of bonds of similarity between machines as measured by the similarity coefficients.

22 The steps of algorithm are as follows: Step 1: Compute similarity coefficients for all possible pairs of machines, Step 2: Select the two most similar machines to form the first machine cell, Step 3: Lower the similarity level (threshold) and form new machine cells by including all the machines with similarity coefficients not less than the threshold value, Step 4: Continue step 3 until all machines are grouped into a single cell.

23 EXAMPLE: Consider the matrix of 5 machines and 10 components given below. Machines M M M31111 M M Components Develop a denrogram and discuss the resulting cell structures.

24 Step 1: Determine similarity coefficients between all pairs of machines. Machine pairs M1 M2 M1 M3 M1 M4 M1 M5 M2 M3 M2 M4 M2 M5 M3 M4 M3 M5 M4 M5 SC Similarity coefficients of machine pairs

25 Step 2: Select machines M2 and M4, having the highest similarity coefficients of 0.83 to form the first cell. Step 3: The next lower coefficient of similarity is between machines M1 and M5. Use these machines to form the second cell.

26 Step 4: The next lower coefficient of similarity is now 0.67 between machines M1 and M4. At this threshold value machines M1, M2, M4, and M5 will form one machine group. The other possible groups will be evaluated by the same way.