CELL FORMATION IN GROUP TECHNOLOGY There are numerous methods available for machine grouping in Group Technology (GT) Here we will discuss the simple method.

Slides:



Advertisements
Similar presentations
Solving LP Models Improving Search Special Form of Improving Search
Advertisements

Operations Research Assistant Professor Dr. Sana’a Wafa Al-Sayegh 2 nd Semester ITGD4207 University of Palestine.
SIMPLEX METHOD FOR LP LP Model.
Transportation Problem (TP) and Assignment Problem (AP)
Introduction to Operations Research
TRANSPORTATION PROBLEM Finding Initial Basic Feasible Solution Shubhagata Roy.
1 Transportation Problems Transportation is considered as a “special case” of LP Reasons? –it can be formulated using LP technique so is its solution (to.
Computational Methods for Management and Economics Carla Gomes Module 8b The transportation simplex method.
Operations Research Assignment Problem.
Quantitative Techniques for Decision Making M.P. Gupta & R.B. Khanna © Prentice Hall India.
Production Scheduling
Dr. Yang, Qingxiong (with slides borrowed from Dr. Yuen, Joe) LT4: Control Flow - Loop CS2311 Computer Programming.
Matrix Multiplication To Multiply matrix A by matrix B: Multiply corresponding entries and then add the resulting products (1)(-1)+ (2)(3) Multiply each.
5.5 Solution Possibilities
Ch. 2: The Art of Presenting Data Data in raw form are usually not easy to use for decision making. Some type of organization is needed Table and Graph.
Transportation Models Transportation problem is about distribution of goods and services from several supply locations to several demand locations. Transportation.
Ch 10: Basic Logic of Factorial Designs & Interaction Effects Part 1: Apr 1, 2008.
Linear Programming Applications
Chapter 26: Comparing Counts. To analyze categorical data, we construct two-way tables and examine the counts of percents of the explanatory and response.
1 Systems of Linear Equations Error Analysis and System Condition.
Sequencing Problem.
SPSS Statistical Package for the Social Sciences is a statistical analysis and data management software package. SPSS can take data from almost any type.
MATRICES. Matrices A matrix is a rectangular array of objects (usually numbers) arranged in m horizontal rows and n vertical columns. A matrix with m.
Transportation Problem Moving towards Optimality ATISH KHADSE.
Game Theory.
Tutorial 5: Working with Excel Tables, PivotTables, and PivotCharts
Solving Systems of Equations and Inequalities
LINEAR PROGRAMMING SIMPLEX METHOD.
ENGINEERING 1181 College of Engineering Engineering Education Innovation Center Problem Solving with Excel Class Preparation.
Hypothesis Testing.
WORKING WITH STRUCTURED DATA (1/3) Functional ICT.
Hungarian Algorithm Vida Movahedi Elderlab, York University June 2007.
Some matrix stuff.
Transportation Transportation models deals with the transportation of a product manufactured at different plants or factories supply origins) to a number.
EE/Econ 458 The Simplex Method using the Tableau Method
This presentation shows how the tableau method is used to solve a simple linear programming problem in two variables: Maximising subject to two  constraints.
Chapter 2 ARRAYS.
Solving Linear Programming Problems: The Simplex Method
Assignment Problem. Definition Assignment Problem is a balanced transportation problem in which all supplies and demand are equal to 1.
Business Mathematics MTH-367 Lecture 15. Chapter 11 The Simplex and Computer Solutions Methods continued.
Multiplying Matrices Dr. Shildneck Fall, Can You Multiply Matrices? ›What do you think has to be true in order to multiply? ›What procedure do you.
Class Opener:. Identifying Matrices Student Check:
XP. Objectives Sort data and filter data Summarize an Excel table Insert subtotals into a range of data Outline buttons to show or hide details Create.
Risk Analysis Simulate a scenario of possible input values that could occur and observe key impacts Pick many input scenarios according to their likelihood.
1 Network Models Transportation Problem (TP) Distributing any commodity from any group of supply centers, called sources, to any group of receiving.
Copyright © 2014 by McGraw-Hill Higher Education. All rights reserved. Essentials of Business Statistics: Communicating with Numbers By Sanjiv Jaggia and.
Network Flow Problems – The Assignment Problem
The Practice of Statistics, 5th Edition Starnes, Tabor, Yates, Moore Bedford Freeman Worth Publishers CHAPTER 11 Inference for Distributions of Categorical.
Hierarchical clustering approaches for high-throughput data Colin Dewey BMI/CS 576 Fall 2015.
BASIC FACILITY LOCATION PROBLEMS Facility location problems deal with the question of where to place facilities & how to assign customers Location analysis.
Distribution Model Meaning Types Transportation Model Assignment Model.
(iii) Simplex method - I D Nagesh Kumar, IISc Water Resources Planning and Management: M3L3 Linear Programming and Applications.
ESTIMATING WEIGHT Course: Special Topics in Remote Sensing & GIS Mirza Muhammad Waqar Contact: EXT:2257 RG712.
Chapter 6 ANALYZING DATA STATISTICALLY There are several commonly used parameters that allow us to draw conclusions about the characteristics of a data.
The Transportation and Assignment Problems
EMGT 6412/MATH 6665 Mathematical Programming Spring 2016
13.4 Product of Two Matrices
Clustering MacKay - Chapter 20.
Matrix Multiplication
Elementary Statistics
Excel Solver IE 469 Fall 2018.
MACHINE GROUPING IN CELLULAR MANUFACTURING With Reduction Of Material Handling As the Objective 19/04/2013 lec # 25 & 26.
Ch 10: Basic Logic of Factorial Designs & Interaction Effects
Inference for Two Way Tables
CUT SET TRANSFORMATION
Ladder Diagram Design: Huffman Method
EECS Introduction to Computing for the Physical Sciences
Labor Assignments In either job or Batch production systems, the problem is to determine the number of workers needed in each station to achieve the required.
BTEC ICT – Unit 18 With Mr Griffiths.
Presentation transcript:

CELL FORMATION IN GROUP TECHNOLOGY There are numerous methods available for machine grouping in Group Technology (GT) Here we will discuss the simple method called as Tabular Method. The method start with 0-1 table called the machine component matrix or incident matrix This table show the machine that each component (e.g., part or job) needs in production; 1 indicating the use of machine & 0 (or a blank) indicating the nonuse of the machine The objective is to develop m/c cells that each component can (as for as possible) be fully processed in a single cell 1/01/20131lec # 17 & 18

CELL FORMATION IN GROUP TECHNOLOGY TABULAR METHOD SOLUTION PROCEDURE: Procedure falls in two phases: In 1 st Phase: the machine is assigned to a group based on its affinity to all the machines that are presently in the group In 2 nd Phase: this phase distributes the jobs in the cells generated in the first phase 1/01/2013lec # 17 & 182

TABULAR METHOD OF CELL FORMATION PHASE 1: This phase of tabular method follows the steps given here Step 1. Develop a machine-to-machine relationship table. A machine-to-machine relationship table 5.2 indicates the number of jobs that are processed on both machines Step 2. Select the initial value of Relationship Counter (RC), RC defines the value of relationship being used in the present calculation these values are taken from table 5.2. Pick the largest element in table 5.2 & designate it as the present value of RC. The RC will change as we go through the iterative process 1/01/2013lec # 17 & 183

TABULAR METHOD OF CELL FORMATION (Cont..) Step 3. Define a value of minimum %age. A measure of effectiveness of joining a machine to a group, such as 50% (P=0.5), is defined by analyzer at the beginning of the problem. It states the closeness an entering machine must have with all the existing machines within a group in order for entering machine to join that group. 1/01/2013lec # 17 & 184

TABULAR METHOD OF CELL FORMATION (Cont..) Step 4. Starting with the first row in table 5.2, examine each row for an elemental value that equals RC. Note the machines in corresponding row and column Step 5. If the associated machines in the row & column are not already in a group, then form a group consisting of these two machines & go to step 7. If both m/cs are already assigned to same group ignore the observation & go to step 7. If one of the machines in the pair is in a group & the other one has not been assigned yet (this machine is called the Entering Machine), go to step 6a. If both machines are assigned, but to different groups, go to step 6b 1/01/2013lec # 17 & 185

TABULAR METHOD OF CELL FORMATION (Cont..) Step 6a. Calculate the closeness ratio of the entering machine with each group that have already been formed. Closeness Ratio (CR) is defined as the ratio of the total of all relationships the entering machine has with the machines that are currently in a group to the total number of machines that are presently assigned to that group Entering machine is placed in a group that has the maximum closeness ratio (MCR), as long as this maximum is greater than or equal to the minimum threshold value (MTV), i.e MTV =Px RC. If the value of value of MCR is less than MTV, then a new group is formed consisting of two machines noted in step 4. which have relationship value that equals the present value of RC. Go to step 7 1/01/2013lec # 17 & 186

TABULAR METHOD OF CELL FORMATION (Cont..) Step 6b. Duplication of one or more machine is suggested. There are two possible alternatives & they are checked subsequently b/c of cost considerations. First alternative is to add one additional machine of either type & place it in appropriate cell; the 2 nd alternative is to add two additional m/cs, one of each type, & form a new group or place the appropriate one in each of existing groups 1/01/2013lec # 17 & 187

TABULAR METHOD OF CELL FORMATION (Cont..) Step 7: Continue the check of machine-to-machine table with the present value of RC proceeding sequentially in rows. If an element is found that is equal to present value of RC, go to step 5. If no such element is found, go to step 8. Step 8: Check to see if all the positive values of RC greater than 0 are checked. If they are, go to step 9; other wise, reduce the value of RC to the next value in its descending order of magnitude & return to step 5. An other termination rule is to stop when all the machines are assigned to at least one group. This stopping rule keeps machine duplications to a minimum 1/01/2013lec # 17 & 188

TABULAR METHOD OF CELL FORMATION (Cont..) Step 9. This step involve group consolidation. Compare the groups formulated so far. If one group-say, G1-contains machine such that it is a subset of another group, then eliminate G1 from any further considerations. 1/01/2013lec # 17 & 189