Design of Manufacturing Systems Manufacturing Cells

Similar documents
Shortening Picking Distance by using Rank-Order Clustering and Genetic Algorithm for Distribution Centers

A PARAMETRIC DECOMPOSITION BASED APPROACH FOR MULTI-CLASS CLOSED QUEUING NETWORKS WITH SYNCHRONIZATION STATIONS

Program Name: PGDBA Production and Operations Management Assessment Name: POM - Exam Weightage: 70 Total Marks: 70

Manufacturing System Flow Analysis

Single Machine Models

Design of Cellular Manufacturing Systems for Dynamic and Uncertain Production Requirements with Presence of Routing Flexibility

CORRELATION AND REGRESSION

Sub-Optimal Scheduling of a Flexible Batch Manufacturing System using an Integer Programming Solution

Applied Integer Programming: Modeling and Solution

Outline. Page 1. Big Picture LAYOUT EXAMPLES LAYOUT OF MACHINES AND FACILITIES

Combinatorial optimization problems

Optimization Prof. A. Goswami Department of Mathematics Indian Institute of Technology, Kharagpur. Lecture - 20 Travelling Salesman Problem

Single Machine Problems Polynomial Cases

RCPSP Single Machine Problems

Classification of Join Ordering Problems

Glossary availability cellular manufacturing closed queueing network coefficient of variation (CV) conditional probability CONWIP

Transportation Problem

Exact Mixed Integer Programming for Integrated Scheduling and Process Planning in Flexible Environment

Cluster Analysis (Sect. 9.6/Chap. 14 of Wilks) Notes by Hong Li

Join Ordering. 3. Join Ordering

Link Prediction. Eman Badr Mohammed Saquib Akmal Khan

P C max. NP-complete from partition. Example j p j What is the makespan on 2 machines? 3 machines? 4 machines?

Analysis of Variance and Co-variance. By Manza Ramesh

Planning and Scheduling of batch processes. Prof. Cesar de Prada ISA-UVA

Feature Engineering, Model Evaluations

Trip Distribution Modeling Milos N. Mladenovic Assistant Professor Department of Built Environment

Geography 360 Principles of Cartography. April 17, 2006

Duration of online examination will be of 1 Hour 20 minutes (80 minutes).

Lecture 23 Branch-and-Bound Algorithm. November 3, 2009

Bottlenecks in Markovian Production Lines: A Systems Approach

Introduction. Table of contents

The Stochastic Facility Layout Problem

Design of Plant Layouts with Queueing Effects

Bryco Machine Welcomes SME and AME. October 1, 2008

Reducing manufacturing lead times and minimizing work-in-process (WIP) inventories

CS6999 Probabilistic Methods in Integer Programming Randomized Rounding Andrew D. Smith April 2003

Throughput Optimization in Single and Dual-Gripper Robotic Cells

GENETIC ALGORITHM FOR CELL DESIGN UNDER SINGLE AND MULTIPLE PERIODS

250 (headphones list price) (speaker set s list price) 14 5 apply ( = 14 5-off-60 store coupons) 60 (shopping cart coupon) = 720.

Chapter 8 Sequences, Series, and Probability

DECISION MAKING SUPPORT AND EXPERT SYSTEMS

CoDa-dendrogram: A new exploratory tool. 2 Dept. Informàtica i Matemàtica Aplicada, Universitat de Girona, Spain;

UNI EN ISO 9001:2008 UNI EN ISO 14001:2004 BS OHSAS 18001:2007 EC DIRECTIVE 2014/34/EU (ATEX) CERTIFIED MANAGEMENT SYSTEM

The Assignment Problem

Deterministic Models: Preliminaries

Divide-and-conquer: Order Statistics. Curs: Fall 2017

Lecture 2. Judging the Performance of Classifiers. Nitin R. Patel

CORRECTNESS OF A GOSSIP BASED MEMBERSHIP PROTOCOL BY (ANDRÉ ALLAVENA, ALAN DEMERS, JOHN E. HOPCROFT ) PRATIK TIMALSENA UNIVERSITY OF OSLO

The Tool Switching Problem Revisited

Introduction to Signal Detection and Classification. Phani Chavali

Type 1. Type 1 Type 2 Type 2 M 4 M 1 B 41 B 71 B 31 B 51 B 32 B 11 B 12 B 22 B 61 M 3 M 2 B 21

PART-MACHINE GROUP FORMATION WITH ORDINAL-RATIO LEVEL DATA & PRODUCTION VOLUME

is called an integer programming (IP) problem. model is called a mixed integer programming (MIP)

Chain of Responsibility

Increase of coal burning efficiency via automatic mathematical modeling. Patrick Bangert algorithmica technologies GmbH 1 Germany

IE652 - Chapter 10. Assumptions. Single Machine Scheduling

Operations Research: Introduction. Concept of a Model

(a i1,1 a in,n)µ(e i1,..., e in ) i 1,...,i n. (a i1,1 a in,n)w i1,...,i n

Lecture Notes 7 Random Processes. Markov Processes Markov Chains. Random Processes

Logic-based Benders Decomposition

Serial Parallel Multiplier Design in Quantum-dot Cellular Automata

HOW TO SUPPORT SPATIAL DECISION MAKING PROCESS? Magdalena Wagner

Chapter 2 Direct Current Circuits

CHAPTER 6. WORK DESIGN and ORGANIZATIONAL PERFORMANCE, WORK MEASUREMENT

Computers and Mathematics with Applications. Module-based architecture for a periodic job-shop scheduling problem

Computer Science & Engineering 423/823 Design and Analysis of Algorithms

Sequence. A list of numbers written in a definite order.

Industrial Processes I Manufacturing Economics

Performance evaluation of generic flexible manufacturing systems

B294B. MATHEMATICS B (MEI) Paper 4 Section B (Higher Tier) GENERAL CERTIFICATE OF SECONDARY EDUCATION. Monday 1 June 2009 Morning.

Introduction to Information Retrieval

Building a Computer Adder

PART- B. Measurements and measurement systems:

Recap. Probability, stochastic processes, Markov chains. ELEC-C7210 Modeling and analysis of communication networks

Using simplified drum-buffer-rope for re-entrant flow shop scheduling in a random environment

Grade 8(Mathematics) EV 4( )

SRI RAMAKRISHNA INSTITUTE OF TECHNOLOGY DEPARTMENT OF SCIENCE & HUMANITIES STATISTICS & NUMERICAL METHODS TWO MARKS

Stochastic programs with binary distributions: Structural properties of scenario trees and algorithms

The tool switching problem revisited

Exercises Stochastic Performance Modelling. Hamilton Institute, Summer 2010

Math 096--Quadratic Formula page 1

Section #2: Linear and Integer Programming

SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION

The Multiple Checkpoint Ordering Problem

HYBRID FLOW-SHOP WITH ADJUSTMENT

A NOVEL SIMULATION METHODOLOGY FOR MODELING CLUSTER TOOLS. Emrah Cimren Robert Havey DongJin Kim

Question Paper Code :

Note that numerically, with white corresponding to 0 and black to 1, the rule can be written:

M.Sc. (Final) DEGREE EXAMINATION, MAY Final Year. Statistics. Paper I STATISTICAL QUALITY CONTROL. Answer any FIVE questions.

Fuzzy Local Trend Transform based Fuzzy Time Series Forecasting Model

Phylogenetic trees 07/10/13

IS 709/809: Computational Methods for IS Research. Math Review: Algorithm Analysis

Modern Logistics & Supply Chain Management

Re: January 27, 2015 Math 080: Final Exam Review Page 1 of 6

Lecture 11: Introduction to Markov Chains. Copyright G. Caire (Sample Lectures) 321

Approximation Algorithms for scheduling

Transversal and cotransversal matroids via their representations.

More on Input Distributions

CS-C Data Science Chapter 8: Discrete methods for analyzing large binary datasets

NECESSARY AND SUFFICIENT CONDITIONS FOR DEADLOCKS IN FLEXIBLE MANUFACTURING SYSTEMS BASED ON A DIGRAPH MODEL

Transcription:

Design of Manufacturing Systems Manufacturing Cells

Outline General features Examples Strengths and weaknesses Group technology steps System design Virtual cellular manufacturing 2

Manufacturing cells general features When cellular manufacturing is applied, parts are grouped into part families and machines into cells. The machines are grouped on the basis of the processing requirements of the part families (different technological processes / machines in the same cell). Cell 1 Cell 2 Cell 3 A B A D A B C C D E B E (*) Product and part are terms used as synonymous during this course 3

Manufacturing cells general features Each product has its own routing within the cell (this is the case when no inter-cell move is required > case of complete cell independence). Cell 1 Cell 2 Cell 3 A B A D A B C C D E B E Part families associated to Cell 1 Part families associated to Cell 2 Part families associated to Cell 3 4

Example 1 LAYOUT 5

Example 2 MANNED OPERATIONS AT LOAD / UNLOAD STATIONS Part families associated to the FMS (Flexible Manufacturing System) 6

Example 3 Part families associated to the FMC (Flexible Manufacturing Cell) MANNED OPERATIONS AT LOAD / UNLOAD STATIONS 7

Some examples https://www.youtube.com/watch?v=e54hazwqpys https://www.youtube.com/watch?v=c50_laifzsk 8

Manufacturing cells general features When cellular manufacturing is applied, it may lead to: re-arrange existent equipment on the factory floor (i.e. machines, ); operate with new equipment, often incorporating various forms of flexible automation (i.e. from machines, material handling equipment,, to FMC/FMS). In other words, a typical question related to system design is required which machines and their associated parts should be grouped together to form cells? before rearranging existent equipment on the factory floor, or incorporating flexible automation. 9

Manufacturing cells Strengths Rationalization of material flows Setup time reduction Production management is easier Overall (compared to the job-shop): WIP reduction Lead time reduction (also considering variability) More reliable estimates of delivery lead times 10

Manufacturing cells Strengths Job enlargement + job enrichment for employees Team work within the cell Unification of product and process responsibilities More control on the quality characteristics of the products 11

Manufacturing cells Weaknesses Difficulties with work load balancing between cells Problems related to production mix variability Difficulties with the application to the whole stages of the production chain In some cases, necessity of more machines than in a job shop Difficulties to manage technological outside the cells Problems related to breakdowns operations 12

Group technology Steps Data collection regarding the production mix and technological routings Classification of products Standardization of products Standardization of technological routings Identification of product families Identification of machine groups forming the cells 13

Rough design of a manufacturing cell After the identification of product families and machine groups, the cells design can be based on the same approach used for the job-shop: calculate the number of machines of type i necessary in the cell; evaluate the number of shifts/day, computing the yearly costs adopting 1, 2 or 3 shifts/day. 14

Group technology Methods Identification of product families based on the classification of products Informal methods Based on geometrical features Based on technological features Part coding analysis methods Based on geometrical features Based on technological features 15

Based on the classification of products Based on geometrical features of products 16

Based on the classification of products Based on technological features of products 17

Based on the classification of products Part coding analysis (example 1) Coding system Part Part code 18

Based on the classification of products Part coding analysis (example 2) Coding system Part Part code 19

Group technology Methods Identification of product families / machine groups forming the cells simultaneously based on PFA (Production Flow Analysis) Cluster analysis ROC (Rank Order Clustering) Similarity coefficients Graph partitioning Mathematical programming 20

Based on PFA Rank Order Clustering Step 1: read each row as a binary number Step 2: order rows according to descending binary numbers Step 3: read each column as a binary number Step 4: order columns according to descending binary numbers Step 5: if on steps 2 and 4 no reordering happened go to step 6, otherwise go to step 1 Step 6: stop 21

Rank Order Clustering Example (1/3) Machine/part matrix a ij = 1 if part j visits machine i a ij = 0 otherwise MACHINE PRODUCTS Decimal TYPE 1 2 3 4 5 6 7 8 number A 1 1 0 0 1 0 0 0 200 B 0 0 0 1 0 0 0 1 17 C 0 1 1 0 0 1 1 0 102 D 0 0 0 1 0 0 0 1 17 E 0 0 1 1 0 1 1 0 54 F 1 1 0 0 1 0 0 0 200 (binary number) 1 x 2 7 + 1 x 2 6 + 0 x 2 5 + 0 x 2 4 + 1 x 2 3 + 0 x 2 2 + 0 x 2 1 + 0 x 2 0 = 200 22

Rank Order Clustering Example (2/3) MACHINE PRODUCTS Decimal TYPE 1 2 3 4 5 6 7 8 number A 1 1 0 0 1 0 0 0 200 F 1 1 0 0 1 0 0 0 200 C 0 1 1 0 0 1 1 0 102 E 0 0 1 1 0 1 1 0 54 B 0 0 0 1 0 0 0 1 17 D 0 0 0 1 0 0 0 1 17 Decimal n. 48 56 12 7 48 12 12 3 (binary number) 1 x 2 5 + 1 x 2 4 + 1 x 2 3 + 0 x 2 2 + 0 x 2 1 + 0 x 2 0 = 56 23

Rank Order Clustering Example (3/3) MACHINE PRODUCTS Decimal TYPE 2 1 5 3 6 7 4 8 number A 1 1 1 0 0 0 0 0 224 F 1 1 1 0 0 0 0 0 224 C 1 0 0 1 1 1 0 0 156 E 0 0 0 1 1 1 1 0 30 B 0 0 0 0 0 0 1 1 3 D 0 0 0 0 0 0 1 1 3 Decimal n. 56 48 48 12 12 12 7 3 Exceptional parts Cell formation inter-cell moves duplication of machines alternative routings buy operations from third parties 3 potential cells 24

Based on PFA Similarity coefficients Step 1: compute the similarity coefficients Where n ij =number of parts worked by both the machines. n i = number of parts worked by machine i n j = number of parts worked by machine j Step 2: join the couple (i*, j*) with the highest similarity coefficient, thus forming the machine group k Step 3: remove rows and columns related to both i* and j* from the original similarity matrix and substitute them with the row and column of the machine group k; then, compute the similarity coefficient s rk = max (s ri*, s rj* ) Step 4: go to step 2 (based on a criterion: single machine group, or predetermined number of machine groups) s ij n = max n ij i ; n n ij j 25

Similarity coefficients Example (1/7) Machine/part matrix a ij = 1 if part j visits machine i a ij = 0 otherwise MACHINE PRODUCTS TYPE 1 2 3 4 5 6 7 8 A 1 1 1 B 1 1 C 1 1 1 1 D 1 1 E 1 1 1 1 F 1 1 1 i j s ij = max n n ij i ; n n ij j max 1 3 ; 1 4 0.33 26

Similarity coefficients Example (2/7) Similarity matrix s ij = similarity coefficients MACHINE MACHINE TYPE TYPE A B C D E F A - 0 0.33 0 0 1 B 0-0 1 0.5 0 C 0.33 0-0 0.75 0.33 D 0 1 0-0.5 0 E 0 0.5 0.75 0.5-0 F 1 0 0.33 0 0-27

Similarity coefficients Example (3/7) Machine/part matrix a ij = 1 if part j visits machine i a ij = 0 otherwise MACHINE PRODUCTS TYPE 1 2 3 4 5 6 7 8 A 1 1 1 i* B 1 1 C 1 1 1 1 D 1 1 E 1 1 1 1 F 1 1 1 j* r s ri* 1 1 = max ; 4 3 0.33 s rj* 1 1 = max ; 4 3 0.33 s ; s 0. 33 s rk = max ri* rj* 28

Similarity coefficients Example (4/7) CELL CELL A, F B C D E A, F - 0 0.33 0 0 B 0-0 1 0.5 C 0.33 0-0 0.75 D 0 1 0-0.5 E 0 0.5 0.75 0.5-29

Similarity coefficients Example (5/7) CELL CELL A, F B, D C E A, F - 0 0.33 0 B, D 0-0 0.5 C 0.33 0-0.75 E 0 0.5 0.75-30

Similarity coefficients Example (6/7) CELL CELL A, F B, D C, E A, F - 0 0.33 B, D 0-0.5 C, E 0.33 0.5-31

Similarity coefficients Example (7/7) Dendrogram A F B D C E 1.0 0.75 0.5 0.33 The dendrogram is a tree used to show the hierarchy of similarities among all the couples of machines (machine groups). 32

Similarity coefficients Example (7/7) Dendrogram Machine/part matrix Product type Cells are formed after defining the minimum similarity coefficients amongst the couples of machines (machine groups) Machine Type 1 2 5 4 8 3 6 7 A 1 1 1 F 1 1 1 B 1 1 D 1 1 C 1 1 1 1 E 1 1 1 1 Cell formation 3 potential cells Exceptional parts 2 exceptional parts 33