Dr. Ron Lembke.  Situation: Assembly-line production.  Many tasks must be performed, and the sequence is flexible  Parts at each station same time.

Slides:



Advertisements
Similar presentations
Operations management is concerned with producing the right goods and services at the right quality and quantity. They need to turn the factors of production.
Advertisements

Math for Liberal Studies. There is a list of numbers called weights These numbers represent objects that need to be packed into bins with a particular.
Resource Management §A resource can be a logical, such as a shared file, or physical, such as a CPU (a node of the distributed system). One of the functions.
Line Balancing Problem A B C 4.1mins D 1.7mins E 2.7 mins F 3.3 mins G 2.6 mins 2.2 mins 3.4 mins.
DAVIS AQUILANO CHASE PowerPoint Presentation by Charlie Cook F O U R T H E D I T I O N Facility Decisions: Layouts © The McGraw-Hill Companies, Inc., 2003.
Chapter 4: Manufacturing Processes. Learning Objectives How production processes are organized Trade-offs to be considered when designing a production.
Process Selection and Facility Layout
OPERATIONS MANAGEMENT INTEGRATING MANUFACTURING AND SERVICES FIFTH EDITION Mark M. Davis Janelle Heineke Copyright ©2005, The McGraw-Hill Companies, Inc.
FACILITY AND WORK DESIGN
Organization of Workstations
1 IRWIN  a Times Mirror Higher Education Group, Inc. company, 1996 Facilities Layout.
6. Processes Selection and Layout
Give qualifications of instructors: DAP
1 Facility Layout. 2 What Is Layout Planning Layout planning is determining the best physical arrangement of resources within a facility Two broad categories.
Chapter 10 – Facility Layout
AB EH C D F G I 10 Min Example Balance for 3 units/hour and compute theoretical min number of stations (primary: longest task time; secondary:
COMSOAL Computer Method for Sequencing Operations for Assembly Lines Lindsay McClintock OPERMGT 345 – 004 May 6, 2003.
Product layout Assembly-line balancing approach. 2 Facility layout Process terminology Cycle time: Average time between completions of successive units.
 The factorial function (n!)  Permutations  Combinations.
Assembly Line Balance Balance.
Facility Layout Dr. Everette S. Gardner, Jr.. Facility Layout2 Machine shop process layout Receiving Grin- Mills ders Raw matl. Large number of storage.
Manual Assembly Lines Chapter 4 Sections:
Chapter 4 Process Design.
Lesson 3-3: Triangle Inequalities 1 Lesson 3-3 Triangle Inequalities.
1 A Fundamental Principle of TPS Produce to Demand 1.Make only what is needed when it is needed. 2.Base production and planning on Takt Time. 3.Develop.
Dr. Naveed Ahmad Assistant Professor Department of Computer Science University of Peshawar.
Which of these can be drawn without taking your pencil off the paper and without going over the same line twice? If we can find a path that goes over all.
McGraw-Hill/Irwin.
Data Analysis Mean, Median, Mode and Box and Whisker.
© Wiley 2007 Chapter 10 Facility Layout. © Wiley 2007 OUTLINE What Is Layout Planning? Types of Layouts Designing Process Layouts Special Cases of Process.
Line Balancing Problem
Manufacturing Processes Operations Management Dr. Ron Lembke.
Assembly Line Balancing
Assembly Line Balancing
CP Summer School Modelling for Constraint Programming Barbara Smith 2. Implied Constraints, Optimization, Dominance Rules.
© The McGraw-Hill Companies, Inc., Technical Note 5 Facility Layout.
Customer and Market Focus Information and Analysis
Line Balancing. Example problem - Golf Club mfg/assy firm Customer demand requires production volume of 24 finished clubs in an 8 hour shift Customer.
McGraw-Hill/Irwin © 2006 The McGraw-Hill Companies, Inc., All Rights Reserved. 1.
Assembly Line Balancing Introduction to Industrial Engineering.
Assembly Line Balancing
Technical Note 6 Facility Layout
© The McGraw-Hill Companies, Inc., Technical Note 5 Facility Layout.
Graphs A ‘Graph’ is a diagram that shows how things are connected together. It makes no attempt to draw actual paths or routes and scale is generally inconsequential.
Manufacturing Processes
OPERATIONS MANAGEMENT for MBAs Fourth Edition 1 Meredith and Shafer John Wiley and Sons, Inc. Chapters 8 & 8S : Capacity, Forecasting Topic 2: Capacity.
Supply.  Supply is based on decisions made by producers in various types of businesses.  Supply is the amount of a product that would be offered at.
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All Rights Reserved. Chapter 6 Process Selection and Facilities Layout.
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All rights reserved.
Chapter 9 Facility Layout. Objectives of Facility Layout Minimize material handling costs Utilize space efficiently Utilize labor efficiently Eliminate.
Facility Layout Objectives of Facility Layout Basic Types
Part 3.
OPPORTUNITY COSTS This section is all about how we make our decisions. All decisions involve a trade- offs. –Trade offs are all the alternatives we give.
Revision BUSI 2301 B. Averaging methods b). Moving average - sample problem Compute a three-period moving average forecast for period 6, given the demand.
Triangle Inequality Theorem The sum of the lengths of any two sides of a triangle is greater than the length of the third side.
6-1 McGraw-Hill/Irwin Operations Management, Seventh Edition, by William J. Stevenson Copyright © 2002 by The McGraw-Hill Companies, Inc. All rights reserved.
Manufacturing Processes
McGraw-Hill/Irwin ©2009 The McGraw-Hill Companies, All Rights Reserved
Processes and facility selection
Processes and facility selection
Additional line balancing notes
Analytical Tools for Process Analysis and Improvement
1. Draw the precedence diagram.
Assembly line balancing
FACILITY LAYOUT Facility layout means:
CSE373: Data Structures & Algorithms Lecture 12: Minimum Spanning Trees Catie Baker Spring 2015.
Real-time 1-input 1-output DSP systems
3 Assembly Line Balancing CHAPTER Arranged by
Route Inspection Which of these can be drawn without taking your pencil off the paper and without going over the same line twice? If we introduce a vertex.
Process Layout Chapter 8 L L M M D D D D L L M M L L M M G G L L G G A
Presentation transcript:

Dr. Ron Lembke

 Situation: Assembly-line production.  Many tasks must be performed, and the sequence is flexible  Parts at each station same time  Tasks take different amounts of time  How to give everyone enough, but not too much work for the limited time.

Belt Conveyor Operations

A Draw precedence graph (times in minutes) C F D B E H G IJ

 Ok: AC|BD|EG|FH|IJ  ABG|CDE|FHI|JC|ADB|FG|EHI|J  NOT ok: BAG|DCH|EFJ|I  DAC|HFE|GBJ|I A C F D B E H G IJ

 AC|BD|EG|FH|IJ= max(25,15,23,15,19) = 25  ABG|CDE|FHI|J= max(40,23,27,7) = 40  C|ADB|FG|EHI|J = max(5,35,18,32,7) = 35 A C F D B E H G IJ CT = maximum of workstation times AC BD EG FH IJ

 The more units you want to produce per hour, the less time a part can spend at each station.  Cycle time = time spent at each spot  C = 800 min / 32 = 25 min  800 min = 13:20 C = Production Time in each day Required output per day (in units)

 Given required cycle time, find out the theoretical minimum number of stations  N t = 97 / 25 = 3.88 = 4 (must round up) N t = Sum of task times (T) Cycle Time (C)

Assign tasks by choosing tasks:  with largest number of following tasks  OR by longest time to complete Break ties by using the other rule

Nodes# after C6 D5 A4 B,E,F3 G,H2 I1 Choose C first, then, if possible, add D to it, then A, if possible. A C F D B E H G IJ

A Draw precedence graph (times in seconds) C F D B E H G IJ

Nodes# after A4 B,E,F3 G,H2 I1 A could not be added to first station, so a new station must be created with A. B, E, F all have 3 stations after, so use tiebreaker rule: time. B = 5 E = 8 F = 3 Use E, then B, then F. A C F D B E H G IJ

A E cannot be added to A, but E can be added to C&D. C F D B E H G IJ

A Next priority B can be added to A. C F D B E H G IJ

A Next priority B can be added to A. Next priority F can’t be added to either. C F D B E H G IJ

Nodes# after G,H2 I1 G and H tie on number coming after. G takes 15, H is 12, so G goes first.

A G can be added to F. H cannot be added. C F D B E H G IJ

A I is next, and can be added to H, but J cannot be added also. C F D B E H G IJ

Why not put J with F&G? A C F D B E H G IJ ABCDE FG J HI

 We know that at least 4 workstations will be needed. We needed 5.  = 97 / ( 5 * 25 ) =  We are paying for 125 minutes of work, where it only takes 97. Efficiency t = Sum of task times (T) Actual # WS * Cycle Time

A Try choosing longest activities first. A is first, then G, which can’t be added to A. C F D B E H G IJ

A H and I both take 12, but H has more coming after it, then add I. C F D B E H G IJ

A D is next. We could combine it with G, which we’ll do later. E is next, so for now combine D&E, but we could have combined E&G. We’ll also try that later. C F D B E H G IJ

A J is next, all alone, followed by C and B. C F D B E H G IJ

F is last. We end up with 5 workstations. 3 A C F D B E H G IJ CT = 25, so efficiency is again Eff = 97/(5*25) = 0.776

A Go back and try combining G and E instead of D and E. C F D B E H G IJ

A J is next, all alone. C is added to D, and B is added to A. C F D B E H G IJ

A F can be added to C&D. Five WS again. CT is again 25, so efficiency is again C F D B E H G IJ

A Back up and combine D&G. No precedence violation. C F D B E H G IJ

A Unhook H&I so J isn’t stranded again, I&J is 19, that’s better than 7. E&H get us to 20. This is feeling better, maybe? C F D B E H G IJ

A 5 Again! CT is again 25, so efficiency is again 97/(5*25) = C F D B E H G IJ

A C F D B E H G IJ

A If we have to use 5 stations, we can get a solution with CT = 20. C F D B E H G IJ

 With 5 WS at CT = 20  = 97 / ( 5 * 20 ) = 0.97  We are paying for 100 minutes of work, where it only takes 97. Efficiency t = Sum of task times (T) Actual # WS * Cycle Time

 With 20 min CT, and 800 minute workday  Output = 800 min / 20 min/unit = 40 units  Don’t need to work 800 min  Goal 32 units: 32 * 20 = 640 min/day  5 workers * 640 min = 3,200 labor min.  We were trying to achieve  4 stations * 800 min = 3,200 labor min.  Same labor cost, but more workers on shorter workday

 Long tasks make it hard to get efficient combinations.  Consider splitting tasks, if physically possible.  If not:  Parallel workstations  use skilled (faster) worker to speed up

 Compute desired cycle time, based on Market Demand, and total time of work needed  Methods to use:  Largest first, most following steps, trial and error  Compute efficiency of solutions  A shorter CT can sometimes lead to greater efficiencies  Changing CT affected length of work day, looked at labor costs