IE 419 1 Work Design: Productivity and Safety Dr. Andris Freivalds Class #5.

Slides:

Advertisements

Similar presentations

6/3/2014 IENG 471 Facilities Planning 1 IENG Lecture Schedule Design: The Sequels Sequel.

Advertisements

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.

Front End Loader Costs ©Dr. B. C. Paul 2000 Start Detailed Economic Comparison of 3 machines l Strategy Go Through Each Machine and Figure the Cost Compare.

Chapter 4: Manufacturing Processes. Learning Objectives How production processes are organized Trade-offs to be considered when designing a production.

IE Work Design: Productivity and Safety Dr. Andris Freivalds Class #2.

1 IRWIN  a Times Mirror Higher Education Group, Inc. company, 1996 Facilities Layout.

Chapter 9– Capacity Planning & Facility Location

Problem Solving Tools INSY 3021 Auburn University Spring 2008.

Chapter 10 – Facility Layout

Facility Layout Facility Layout Facility Layout decisions translate the broader decisions about a firm’s strategy such as competitive priorities, process,

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

Stat 301 – Day 20 Sampling Distributions for a sample proportion (cont.) (4.3)

COMSOAL Computer Method for Sequencing Operations for Assembly Lines Lindsay McClintock OPERMGT 345 – 004 May 6, 2003.

Chapter 14 – Gases Kinetic Molecular Theory (KMT) Defn – describes the behavior of gases in terms of particle motion Defn – describes the behavior of.

KESEIMBANGAN LINI PRODUKSI (PRODUCTION LINE BALANCING) (Bagian 1)

9/10/2015 IENG 471 Facilities Planning 1 IENG Lecture Schedule Design: The Sequel.

Dr. Cesar Malave Texas A & M University

Facility Layout Dr. Everette S. Gardner, Jr.. Facility Layout2 Machine shop process layout Receiving Grin- Mills ders Raw matl. Large number of storage.

1 Computer Communication & Networks Lecture 12 Datalink Layer: Multiple Access Waleed Ejaz

Introduction to the Theory of Constraints (TOC) & Critical Chain Project Management (CCPM) Major Mark McNabb.

© 2007 Pearson Education Simulation Supplement B.

© 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

10/25/2015 IENG 471 Facilities Planning 1 IENG Lecture Schedule Design: The Sequel.

Assembly Lines – Reliable Serial Systems

Assembly Line Balancing

Mba Facility Layout u Basic layouts u Some layout techniques u Assembly line balancing u Service Layout.

© The McGraw-Hill Companies, Inc., Technical Note 5 Facility Layout.

4: DataLink Layer1 Multiple Access Links and Protocols Three types of “links”: r point-to-point (single wire, e.g. PPP, SLIP) r broadcast (shared wire.

Process Layout Chapter 7 July 20, 2005.

Line Balancing. Example problem - Golf Club mfg/assy firm Customer demand requires production volume of 24 finished clubs in an 8 hour shift Customer.

Stat 13 Lecture 19 discrete random variables, binomial A random variable is discrete if it takes values that have gaps : most often, integers Probability.

McGraw-Hill/Irwin © 2006 The McGraw-Hill Companies, Inc., All Rights Reserved. 1.

Assembly Line Balancing Introduction to Industrial Engineering.

Reid & Sanders, Operations Management © Wiley 2002 Facility Layout 10 C H A P T E R.

Machine Review. Inclined Plane Effort Force Load Distance Load Force Effort Distance.

This presentation is for educational purpose only – Copyrights 2014 © Dr Ahmed Jaheen.

Layout and Design Kapitel 4 / 1 (c) Prof. Richard F. Hartl Flow shop production Object-oriented Assignment is derived from the item´s work plans. Uniform.

Operations Fall 2015 Bruce Duggan Providence University College.

Queuing Models in Operations

Facilities design. Main Topics Discrete vs. Continuous Flow and Repetitive Manufacturing Process vs. Product-focused designs and the other currently used.

Sampling and estimation Petter Mostad

Algorithm A procedure described by a series of steps. Click here for Hint project or algorithm or load distance?

Work-in-process (WIP) Inventory resulting from transformation of raw materials, but not yet ready for sale to consumers. Click here for Hint finished goods.

IE 366 Chapter 9 Organization of Workstations Supplementary Material from: Groover, M.P. (2007). Work Systems and the Methods, Measurement, and Management.

Supply Chain Customer Order Decoupling Point

Introduction to the Theory of Constraints (TOC) & Critical Chain Project Management (CCPM) Major Mark McNabb.

McGraw-Hill/Irwin ©2009 The McGraw-Hill Companies, All Rights Reserved

Perancangan Sistem Manufaktur

Additional line balancing notes

Copyright © 2014, 2010, 2007 Pearson Education, Inc.

Load Balancing: List Scheduling

organizational structure

Ch. 8 – Sequences, Series, and Probability

Assoc. Prof. Dr. Peerapol Yuvapoositanon

Advanced Placement Statistics Section 7.2: Means & Variance of a

3 Assembly Line Balancing CHAPTER Arranged by

Link Layer and LANs Not everyone is meant to make a difference. But for me, the choice to lead an ordinary life is no longer an option 5: DataLink Layer.

Continuous Random Variable Normal Distribution

Binomial Theorem; Pascal’s Triangle

Process Selection and Facility Layout Lecture 5. Forecasting Product and Service Design Technological Change Capacity Planning Process Selection Facilities.

Using the queuing-theoretic approximations for the performance of “push” and “pull” production lines to address Design Problems.

Summer Training Industrial Engineering Department

Load Balancing: List Scheduling

Simulation Supplement B.

Simulation Supplement B

Algebra and Indices.

Presentation transcript:

IE Work Design: Productivity and Safety Dr. Andris Freivalds Class #5

IE Work Design: Productivity and Safety Dr. Andris Freivalds Class #5

IE Worker-Machine Relationships (Ch. 2, pp ) Worker-machine relationships –Synchronous servicing – regular cycles –Random (asynchronous) servicing – random –Combination – real life N ≤ (l + m) (l + w)

IE Ex. #1 l = 1.0, m = 2.0, w = 0.1 Oper=$10/hr, Mach=$20/hr 3 machines ($1.28) 2 machines ($1.25)

IE Ex. 3 – No Load l = 0, m = 1.2, w = 2.0, oper = $10/hr, mach = $15/hr TimeOperMach

IE Ex. 3 – No Load l = 0, m = 1.2, w = 2.0, oper = $10/hr, mach = $15/hr TimeOper1Oper2Mach

IE Random Servicing Machine servicing is not regular Most likely it is random (don’t know when) Use probability theory to estimate % idle time (binomial expansion) Probability of m (out of n) machines down = n! p m q (n-m) m! (n-m)! p = prob of down time q = prob of up time = 1-p

IE Ex #1: n=3, p=0.1, q=0.9, % idle time? Mach down (m) Probability n! p m q (n-m) / m! (n-m)! Mach hrs lost (1 op) Mach hrs lost (2 op) Mach hrs lost (3 op) Total

IE Ex #1 con’t: oper = $10/hr, mach = $500/hr, prod = 120 units/hr 1 oper2 oper3 oper idle Prod (8 hr) Cost (8 hr) Unit cost

IE Ex #2: n=3, p=0.4, q=0.6 mProbabilityHrs lost (1 oper) Hrs lost (2 oper)

IE Ex #2 con’t: oper = $10/hr, mach = $60/hr, prod = 60/hr 1 oper2 oper3 oper idle Prod (8 hr) Cost (8 hr) Unit cost

IE Complex Relationships (n↑) n > 6 Use Wright’s formula i = interference, % of l n = # machines x = m/l n ≤ 6 i = 50{[(1+x-n) 2 +2n] ½ - (1+x-n)}

IE Ex #3: m = 7, l =1, n = 6 n > 6 Use Wright’s formula i = interference, % of l n = # machines x = m/l n ≤ 6 i = 50{[(1+x-n) 2 +2n] ½ - (1+x-n)}

IE (Assembly) Line Balancing (Ch. 2, pp ) Worker-machine relationship determining ideal number of workers/workstations in production line Simple straight line (Ex #1): OperST/opDelay time ST ReqST #OperNew ST/op New Delay

IE Straight Line Balancing ( Ex #1 con’t) OperST/opDelay time ST ReqST #OperNew ST/op New Delay % efficiency (E) = 100 x ∑ST/∑AT % idle = 100 x ∑DT/∑AT Req. production (R) = 3,200/day → required standard (cycle) time # oper = R x ∑ST = ∑ST/ CT=

IE Complex Line Balancing ( Ex #2) Time set by slowest station (cycle time) Assign operators to a workstation: –Until cycle time is about to be exceeded –In order of decreasing positional weight –PW = ∑ST for all with “1” relationship –As allowed by precedence (i.e. immediate predecessors (IP) need to be assigned)

IE Positional Weight (PW) Matrix OpSTDT PWIP

IE Fill Workstations (Ex #2 con’t) # workstations = Rx∑ST = ∑ST/ CT= OperIPPWSTStation TDelay T