Process Analysis III Operations -- Prof. Juran. Outline Set-up times Lot sizes Effects on capacity Effects on process choice.

Slides:



Advertisements
Similar presentations
© BMA Inc All rights reserved. Decision-making Making routine decisions without the help of standard costs.
Advertisements

Tests of Hypotheses Based on a Single Sample
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.
Capacity Planning. How much long-range capacity is needed When more capacity is needed Where facilities should be located (location) How facilities should.
Capacity Planning For Products and Services
Process Analysis III. © The McGraw-Hill Companies, Inc., 2004 Operations -- Prof. Juran2 Outline Set-up times Lot sizes Effects on capacity Effects on.
Optimization problems using excel solver
Decision Making and Relevant Information
Strategic Capacity Planning for Products and Services
MD707 Operations Management Professor Joy Field
6 – 1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Capacity Planning 6 For Operations Management, 9e by Krajewski/Ritzman/Malhotra.
McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. 5 Capacity Planning For Products and Services.
Strategic Capacity Planning for Products and Services McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
© BMA Inc All rights reserved. Decision-making Making routine decisions without the “help” of standard costs.
Session 3a Decision Models -- Prof. Juran.
Process Analysis II. © The McGraw-Hill Companies, Inc., 2004 Operations -- Prof. Juran2 Outline Types of Processes Kristin Benihana Scientific Management.
Process Analysis II Operations -- Prof. Juran.
Calculate Point of Indifference Between Two Cost Scenarios
IE 3265 Production & Operations Management Slide Series 2.
1 Mathematical Programming Integer Programming. 2 Common Types of IP’s and IP Constraints Two common types of IP’s –#1: Capital budgeting –#2: Set covering.
Session 10b. Decision Models -- Prof. Juran2 Overview Marketing Simulation Models New Product Development Decision –Uncertainty about competitor behavior.
Chapter 6 Product Design & Process Selection-Manufacturing
IE 3265 Production & Operations Management Slide Series 2.
DRIVING INNOVATION AND ABILITY TO COMPETE THROUGH OUTSOURCING Anthony (Tony) C. Bernardo, Alloy Polymers Inc. NPE 2003 bernardo:
Optimization I Operations -- Prof. Juran. Outline Basic Optimization: Linear programming –Graphical method –Spreadsheet Method Extension: Nonlinear programming.
Introduction to Mathematical Programming OR/MA 504 Chapter 5 Integer Linear Programming.
Copyright © 2003 Pearson Education Canada Inc. Slide Chapter 11 Decision Making and Relevant Information.
Cost Behavior Analysis
1/20 Operations Management Break-Even Analysis - Lecture 4.2 Dr. Ursula G. Kraus.
Chapter 6 Production Processes.
Slide Sets to accompany Blank & Tarquin, Engineering Economy, 6 th Edition, 2005 © 2005 by McGraw-Hill, New York, N.Y All Rights Reserved 1-1 Developed.
©2006 Pearson Prentice Hall — Introduction to Operations and Supply Chain Management — Bozarth & Handfield Chapter 8, Slide 1 Capacity Decisions Defining.
Example 5.8 Non-logistics Network Models | 5.2 | 5.3 | 5.4 | 5.5 | 5.6 | 5.7 | 5.9 | 5.10 | 5.10a a Background Information.
Copyright 2006 John Wiley & Sons, Inc. Beni Asllani University of Tennessee at Chattanooga Processes, Technology, and Capacity Operations Management -
Copyright © 2008 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin 12 Financial and Cost- Volume-Profit Models.
Spreadsheet Modeling & Decision Analysis:
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.
Spreadsheet Modeling and Decision Analysis, 3e, by Cliff Ragsdale. © 2001 South-Western/Thomson Learning. 6-1 Integer Linear Programming Chapter 6.
Managing Processes and Capabilities CHAPTER THREE.
The McGraw-Hill Companies, Inc. 2006McGraw-Hill/Irwin 12 Financial and Cost- Volume-Profit Models.
CHAPTER 3 PROCESS MANAGEMENT. WHAT IS PROCESS MANAGEMENT ? The selection of the inputs, operations, work flows and methods that transform inputs into.
1 DSCI 3123 Process Planning And Technology Process Strategy Process Planning Make-Or-Buy Decisions Process & Specific Equipment Selection Process Analysis.
Lecture 6 – Integer Programming Models Topics General model Logic constraint Defining decision variables Continuous vs. integral solution Applications:
Break-even Analysis. Break - Even Analysis (Cost/Volume/Profit Analysis) n This is a planning and control technique. n PLANNING: – make informed decisions.
Copyright © 2010 by The McGraw-Hill Companies, Inc. All rights reserved. Chapter Competitiveness, Strategy, and Productivity 2 Slides prepared by Laurel.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Blank & Tarquin: 5 th edition. Ch.13 Authored by Dr. Don Smith,
Optimization I. © The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran2 Outline Basic Optimization: Linear programming –Graphical.
Strategic issues to be considered Make or buy Technology selection Make-to-stock vs. Make-to-order.
Operational Research & ManagementOperations Scheduling Economic Lot Scheduling 1.Summary Machine Scheduling 2.ELSP (one item, multiple items) 3.Arbitrary.
© 2012 Pearson Prentice Hall. All rights reserved. Using Costs in Decision Making Chapter 3.
1 Inventory Control with Time-Varying Demand. 2  Week 1Introduction to Production Planning and Inventory Control  Week 2Inventory Control – Deterministic.
Systems of Linear Equations in Two Variables. 1. Determine whether the given ordered pair is a solution of the system.
8/14/04 J. Bard and J. W. Barnes Operations Research Models and Methods Copyright All rights reserved Lecture 6 – Integer Programming Models Topics.
McGraw-Hill/Irwin Copyright © 2013 by The McGraw-Hill Companies, Inc. All rights reserved. Break-Even Analysis Chapter 6a.
Lecture 6 – Integer Programming Models Topics General model Logic constraint Defining decision variables Continuous vs. integral solution Applications:
Management Science 461 Lecture 3 – Covering Models September 23, 2008.
Short Term Decision Making Chathuri Senarath Senior Lecturer- University of Kelaniya MEcon(UOC), BCom Sp (Hons) (UOC), CIMA (UK) Passed Finalist, AAT (SL)
Manufacturing Processes
Chapter 7: Manufacturing Processes
Class 10: Introduction to Linear Programming
SUMMARY POSITIVE SLOPE NEGATIVE SLOPE ZERO SLOPE UNDEFINED SLOPE.
Process Analysis.
Process Planning And Technology
Capacity Planning For Products and Services
Systems of Linear Equations in Two Variables
Optimization I.
Managerial Accounting 2002e
Integer Linear Programming
Capacity Planning For Products and Services
Presentation transcript:

Process Analysis III Operations -- Prof. Juran

Outline Set-up times Lot sizes Effects on capacity Effects on process choice

Operations -- Prof. Juran Set-up Times Many processes can be described (at least approximately) in terms of –a fixed set-up time and –a variable time per unit (a.k.a. cycle time) Capacity of a single activity is a function of lot size, set-up time, and cycle time Overall capacity of a system depends on these factors and the resulting bottlenecks across multiple activities

Operations -- Prof. Juran Example: Kristen In general, a formula for the number of minutes to produce n one- dozen batches is given by this expression: Set-up time Cycle time per 1-dozen batch This views the cookie operation as a single activity. We arrived at these numbers through analysis of individual sub-activities at a more detailed level.

Operations -- Prof. Juran Example: Kristen Note that Kristen’s effective cycle time is 10 minutes per 12 cookies, or minutes per cookie, assuming a lot size of 12 cookies. We can determine the capacity of the system in a specific period of time T by solving for n :

Operations -- Prof. Juran Example 1 We can determine the capacity of the system in a specific period of time T by solving for n. How many 1-dozen batches could Kristen produce in 4 hours? In this situation, the capacity of the system is a linear function of the time available.

Operations -- Prof. Juran

Example 2 This assumes that the set-up only needs to be done once. What if there were a 16-minute set-up for every lot? This effectively makes the set-up time zero, and the cycle time 26 minutes per 12-cookie lot. Capacity is still a linear function of the time available.

Operations -- Prof. Juran

Let’s make some assumptions; a system similar (but not identical) to the Kristen system: Produce individual units (cookies) The cycle time is minutes per cookie The set-up time is s minutes, and needs to be performed again for every “lot” of 12 cookies The capacity of this system (in “lots”) over 240 minutes is: 240/( s * 12) The capacity of this system (in “lots”) with a 16-minute set-up is: 240/( s * 12) = 9.23 (or 9.23 * 12 = cookies)

Operations -- Prof. Juran

Now let’s assume the time available is fixed at 240 minutes, and study the effect on capacity that results from changing the set-up time. The capacity of this system (in “lots”) with an s -minute set-up is: 240/( s * 12) (a nonlinear function of the set-up time) Example 3

Operations -- Prof. Juran

Capacity could also be measured in “cookies” instead of “12-cookie lots”:

Operations -- Prof. Juran Extreme Case 1: If the set-up time is zero, then the capacity of this system (in “lots”) over 240 minutes is: 240/( * 12) = 24 lots Extreme Case 2: If the set-up time is 240, then the capacity of this system (in “lots”) over 240 minutes is zero (because all of the time is consumed by setting up)

Operations -- Prof. Juran

Now let’s assume the time available is fixed at 240 minutes, AND fix the set-up time at 16 minutes, to study the effect on capacity that results from changing the lot size. The capacity of this system (in “cookies”) with an s -minute set-up is: 240/( * Q ) (another nonlinear function) Example 4

Operations -- Prof. Juran Extreme Case 1: 240/16 = 15 gives an upper bound to the number of lots; in that case we would use up all of our time setting up, and never make any cookies. Extreme Case 2: If we assume only one set-up, then the capacity is / = cookies The largest lot that can be completed in 240 minutes is 268. Extreme Case 3: If we assume no set-up, then the capacity is 240/ = 288 cookies The largest lot that can be completed in 240 minutes is 288.

Operations -- Prof. Juran

Example 5 What if the lot size AND the set-up time are variables? We can determine the capacity of the system in a specific period of time using this complicated function of lot size, cycle time, set-up time, and the time available for production:

Operations -- Prof. Juran Assume 240 minutes available, and minute cycle time:

Operations -- Prof. Juran

Why Do We Care? It might be on the exam Drives major decisions regarding operations strategy, technology choice, process design, and capital investment

Operations -- Prof. Juran Process Choice Sometimes we get to choose among several possible technologies One important factor is capacity: Which technology can meet demand fastest? This may depend on lot size Similar to make-vs-buy decisions

Operations -- Prof. Juran

Colarusso Confectioners needs to fill an order for 500 sfogliatelle (a famous Italian pastry) for one of their clients. Colarusso has the in-house capability to produce sfogliatelle, but this is an unusually large order for them and they are considering whether to outsource the job to Tumminelli Industries, Inc. (a regional pastry supplier with equipment designed for greater volume). The customer service rep from Tumminelli quotes a rate for sfogliatelle as follows: a fixed order cost of $135 plus $0.25 per sfogliatella. Colarusso’s in-house costs are $75.00 to set up production and $0.39 per unit. Example: Make vs. Buy

Operations -- Prof. Juran What should Colarusso do with this order for 500 svogliatelle? The total cost of the order will be lower if Colarusso outsources this job to Tumminelli.

Operations -- Prof. Juran Obviously Colarusso has an advantage for small lot sizes, and Tumminelli has an advantage for large lot sizes. What is the break- even point?

Operations -- Prof. Juran Finding the break-even point algebraically:

Operations -- Prof. Juran Process Choice Example All-American Industries is considering which of two machines to purchase: 1.If the typical lot size is 200 units, which machine should they buy? 2.What is the capacity of that machine in a 480-minute shift? 3.What is the break-even lot size for these two machines?

Operations -- Prof. Juran 1.If the typical lot size is 200 units, which machine should they buy?

Operations -- Prof. Juran

2.What is the capacity of that machine in a 480-minute shift?

Operations -- Prof. Juran

3.What is the break-even lot size for these two machines?

Operations -- Prof. Juran

Summary Set-up times Lot sizes Effects on capacity Effects on process choice