1 Slide Process Analysis Fundamentals MGT3303. 2 Slide Process Definition  A process is a collection of operations connected by a flow of transactions.

Slides:



Advertisements
Similar presentations
EMBA-2, BUP Major Asad EO Chapter 5: Process Analysis.
Advertisements

Operations Management For Competitive Advantage © The McGraw-Hill Companies, Inc., 2001 C HASE A QUILANO J ACOBS ninth edition 1 Process Analysis Operations.
Process Analysis If you cannot describe what you are doing as a process, you do not know what you are doing. W.E. Deming.
Process Capacity.
Utdallas.edu/~metin 1 Understanding the Supply Process: Evaluating Process Capacity Chapter 3.
SMA 6304/MIT2.853/MIT2.854 Manufacturing Systems Lecture 19-20: Single-part-type, multiple stage systems Lecturer: Stanley B. Gershwin
Process Design and Analysis
Process Analysis II. © The McGraw-Hill Companies, Inc., 2004 Operations -- Prof. Juran2 Outline Types of Processes Kristin Benihana Scientific Management.
11–1. 11–2 Chapter Eleven Copyright © 2014 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin.
MBA 8452 Systems and Operations Management
Operations Management
IV. Little’s Law and Labor Costs
from Prof. Goldsman’s lecture notes
Managing Process Flows
Little’s Theorem Examples Courtesy of: Dr. Abdul Waheed (previous instructor at COE)
Little´s law Skorkovský ,KPH,ESF.MU
6-1 McGraw-Hill/Irwin Operations Management, Seventh Edition, by William J. Stevenson Copyright © 2002 by The McGraw-Hill Companies, Inc. All rights reserved.
Irwin/McGraw-Hill 1 Process Analysis Terms Process: Is any part of an organization that takes inputs and transforms them into outputs. Cycle Time: Is the.
Chapter 3 An Introduction to Operations Management
BIS 494: Topics in Information Systems 1 Managing Process Flows Chapter 5 Business Process Modeling, Simulation and Design.
OPSM 301: Operations Management Session 7: Process analysis Koç University Zeynep Aksin
6-1 McGraw-Hill/Irwin Operations Management, Seventh Edition, by William J. Stevenson Copyright © 2002 by The McGraw-Hill Companies, Inc. All rights reserved.
Product layout Assembly-line balancing approach. 2 Facility layout Process terminology Cycle time: Average time between completions of successive units.
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All rights reserved.
Assembly Line Balance Balance.
McGraw-Hill/Irwin © 2006 The McGraw-Hill Companies, Inc., All Rights Reserved. 1.
Chapter 6 Process Analysis.
1 © The McGraw-Hill Companies, Inc., 2004 Introduction (from Chase) Process Analysis.
1-1 1 McGraw-Hill/Irwin ©2009 The McGraw-Hill Companies, All Rights Reserved.
Figure 3.1.: Photo of the Circored Plant. ~ 160 m Iron Ore Fines CFB Preheater Inclined Bucket Elevator 1st Stage CFB Reactor 2nd Stage FB Reactor Briquetting.
II. Operations Strategy and Process Choice
Introduction to Management Science
Dr. Cesar Malave Texas A & M University
AN INTRODUCTION TO THE OPERATIONAL ANALYSIS OF QUEUING NETWORK MODELS Peter J. Denning, Jeffrey P. Buzen, The Operational Analysis of Queueing Network.
Introduction to the Theory of Constraints (TOC) & Critical Chain Project Management (CCPM) Major Mark McNabb.
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.
Managing Processes and Capabilities CHAPTER THREE.
Economics Chapter 5: Supply Economics Chapter 5: Supply Supply is the amount of a product that would be offered for sale at all possible prices in the.
Lecture 14 – Queuing Networks Topics Description of Jackson networks Equations for computing internal arrival rates Examples: computation center, job shop.
Scheduling (Part II) Mohd Zaidan bin Abdul Aziz B
1 Slides used in class may be different from slides in student pack Chapter 5 Process Analysis  Process Analysis  Process Flowcharting  Categories of.
Assembly Lines – Reliable Serial Systems
Assembly Line Balancing
The Impact of Variability on Process Performance.
Process Analysis CHAPTER 5. Learning Objectives 1. Recognize three basic types of processes: a serial flow process, parallel processes (such as what happens.
Operations Management For Competitive Advantage 1 Process Analysis Operations Management For Competitive Advantage Chapter 4.
Process Analysis I Operations -- Prof. Juran.
Drum –Buffer-Rope Based on : R. Holt, Ph.D., PE
Process Layout Chapter 7 July 20, 2005.
IE450 Models Relating Cycle-time, Throughput, WIP and Batch Sizes
Operations Fall 2015 Bruce Duggan Providence University College.
Activity Scheduling and Control
Part 3.
6-1 McGraw-Hill/Irwin Operations Management, Seventh Edition, by William J. Stevenson Copyright © 2002 by The McGraw-Hill Companies, Inc. All rights reserved.
Key Learnings: Little’s Law
Theoretical Capacity Theoretical capacity: The capacity (throughput rate) of a process under ideal conditions (units / time) Effective capacity: The capacity.
Introduction to the Theory of Constraints (TOC) & Critical Chain Project Management (CCPM) Major Mark McNabb.
Chapter 5 Process Analysis. Chapter 5 Process Analysis.
Additional line balancing notes
Analytical Tools for Process Analysis and Improvement
Process Design and Analysis
Process Analysis.
FACILITY LAYOUT Facility layout means:
Chapter 5 Process Analysis.
IV-2 Manufacturing Systems modeling
Process Analysis “If you cannot describe what you are doing as a process, you do not know what you are doing.” W.E. Deming.
L Maximizing Resources: Applying Lean Six Sigma Principles to Your Print Operation Monday March 18, AM – 12 PM.
GATORADE MX Production
Chapter 5 Process Analysis.
Presentation transcript:

1 Slide Process Analysis Fundamentals MGT3303

2 Slide Process Definition  A process is a collection of operations connected by a flow of transactions and information that transforms various inputs into outputs using resources.  A process maybe deterministic or stochastic (probabilistic) Components are processed on an automated machine. People walk to a window, buy a ticket and leave with a ticket. People arrive at scheduled times and receive some service. Process Input Output

3 Slide Process Diagrams  Process Diagrams are used to analyze various processes.  We first start by a precedence diagram, that includes the following symbols  Example: Precedence diagram for product X, (times in seconds) Operation Precedence 1 : 20 2 : 50 3 : 10 5 : 30 4 : 40 6 : 307 : 20

4 Slide Process Diagrams Based on the precedence diagram we draw a process diagram, which includes the following symbols: Resource at a stage Buffer / Storage Material flow Information flow

5 Slide Example: Trinidad’s “circored iron ore” plant Fluidized bed based Circored® technology: The process uses hydrogen from natural gas to reduce iron ore fines, significantly decreasing the costs of the steelmaking process due to the elimination of the agglomeration step. The high quality, low cost product can be used as pure scrap substitute in electric arc furnaces as well as for increasing the capacity of existing blast furnaces with corresponding coke savings. - Trinidad with ample natural gas - Port Lisas in the Claxton Bay, most dependable port in the Caribbean - Proximity to iron ore rich South America

6 Slide Example: Trinidad’s “circored iron ore” plant

7 Slide Process Flow Chart (Diagram) ~ 160 m Iron Ore Fines CFB Preheater Inclined Bucket Elevator 1st Stage CFB Reactor CFB: Circulating Fluidized Bed 1st Stage Reactor Briquetting Plant HBI Product Process Gas Heat Exchanger Process Gas Compressor Fired Gas Heaters ~ 110 m Electrical Substation& Control Room

8 Slide Process Flow Chart (Diagram) Pile of Iron ore fines Pre-Heater Briquetting Discharge Flash heater Finished goods 1 st (cfb) Reactor 2nd (fb) Reactor

9 Slide Process Parameters  Input rate gives the entering rate of jobs; in [Q/T].  Output rate ( i.e. flow rate, production rate, throughput rate) gives the exit rate of jobs ; in [Q/T].  Capacity is the maximum output rate possible; [Q/T].  Cycle time (CT) is the reciprocal of capacity; in [T/Q].  Minimum Manufacturing Lead Time (MLT) (min flow time) is the fastest processing time for a transaction to go through the process, when the process is empty; in [T].

10 Slide Process Parameters When the process is running:  Actual cycle time is the reciprocal of output rate; in [T/Q].  Average Manufacturing Lead Time (MLT) (flow time) is the average time required for a transaction to go through the process; in [T].  Work-In-Process (WIP) is the average over time number of transactions in the process; in [Q].

11 Slide Example 1 (a) A new component is scheduled every 10 minutes. The Gantt chart : ???  input rate = ?  output rate = ?  actual cycle time = ?  The average MLT = ? M1 4 X Y

12 Slide Example 1 Solution for (a):  Since each job enters the system every 10 minutes, the input rate will be 1/10 [units / min].  The output rate will be 1/10 [units / min].  The actual cycle time is 10 [min / units].  The average MLT is 4 [min].  Notice in the Gantt chart that between time units 4 to 10, the machine is idle.

13 Slide Example 1 (b) A new component is scheduled every 4 minutes. The Gantt chart : ???  input rate = ?  output rate = ?  actual cycle time = ?  The average MLT = ?

14 Slide Example 1 Solution for (b):  Since each job enters the system every 4 minutes, the input rate is 1 / 4 [unit / min].  Also, the output rate will be same as the input rate, i.e. Output rate = 1 / 4 [unit / min] = 15 [units / hour].  The actual cycle time is 4 [min / units].  The average MLT is 4 [min].

15 Slide Example 1 (c) A new component is scheduled every 3 minutes. The Gantt chart : ???  input rate = ?  output rate = ?  actual cycle time = ?  The average MLT = ?

16 Slide Example 1  Since each job enters the system every three minutes, the input rate will be 1/3 [unit / min] or 20 [units / hour].  M1 can process jobs every 4 minutes. So the output rate will be only 1/4 [unit / min] = 15 [units / hour].  You can see that every subsequent job stays one more minute in the buffer that the previous job and we won’t be able draw all theses jobs in the buffer.  The actual cycle time is 4 [min / units]. The minimum MLT is 4 [min].  The MLT tends to infinity as time goes to infinity. In fact, each successive transaction stays 1 minute longer and the system never becomes stable. The average MLT is undefined.  The WIP (in an instance of time) and the average WIP also go to infinity

17 Slide Important Properties  Any process will not become stable if the input rate is greater than the system capacity  Output rate can never exceed capacity.  For sequential stages, the capacity is determined by the slowest stage called the bottleneck.  When machines are in parallel (performing the same operation), capacities add.

18 Slide Example 2  We still consider a single stage process: (in seconds)  Part (a): If you need to process 1125 units per hour, do you need an extra machine?  Part (b): If so, what should be the per-unit processing time on this extra machine? M1, 10 M2, 16 M3, 20

19 Slide Example 2  Part (a): We have three machines in parallel and should first find the process capacity. When machines are in parallel, the capacity of the process is equal to the sum of capacities of individual machines. Capacity of M1 = 1/10 [units / second] = 360 [units / hour], Capacity of M2 = 225 [units / hour], Capacity of M3 = 180 [units / hour]. System capacity = 765 [units / hour]. We therefore need an extra machine.  Part (b): Since we need the capacity of 1125, the extra machine should have the capacity of (1125 – 765) = 360 [units / hour]. The processing time on the extra machine (say M4) should be 10 seconds.

20 Slide Little’s Law  Prof. John D. C. Little of MIT Sloan School of Management, developed the proof for the following formula for a stable system: L = λ * W where L is the average number of customers in the system, λ is the arrival rate and W is the average time in the system.  Let’s apply it in our case: WIP = average MLT * output rate = average MLT / actual CT VERY IMPORTANT ….. !!!!

21 Slide Example 3  A process involves two sequential tasks. Part (a)  CT for station 1?  CT for station 2?  Bottleneck Station?  Process Capacity?  CT for the process?  Minimum MLT? M1, 10M2, 8

22 Slide Example 3  Cycle time for Station 1 is 10 [min. / unit]  Cycle time for Station 2 is 8 [min. / unit]  Bottleneck is Station 1  Process Capacity is 1/10 [units / min.]  Cycle time for the process is 10 [min. / unit]  Minimum MLT: It will take at least 10 [min.] + 8 [min.] = 18 minutes when system is empty

23 Slide Example 3  Part (b): Consider the following schedule. Starting at time 0, one new job enters the process at station 1 every 10 mins. i. Calculate the actual cycle time and the flow rate (i.e. output rate). ii. Calculate the average MLT iii. Calculate WIP contribution of each resource and the total. iv. Verify Little’s formula.

24 Slide Example 3 i. From the Gantt chart, a job will come off the process at times 18, 28, 38, 48, 58, ….; i.e. every 10 minutes. The actual CT = 10 [min. / unit] and the flow rate = 1/10 [units / min]. ii. The first job enters the process at 0 and comes out at 18, the second job enters the process at 10 and comes out (after 18 minutes) at 28. In fact every job will stay in the process of 18 minutes. Therefore average MLT = 18 [min.] iii. Notice from the Gantt chart that station 1 is always occupied by a job. So the contribution of station 1 to the WIP is 1.00 [units]. Therefore the WIP contribution of station 2 is 0.80 [units] and the total WIP is 1.80 [units]. iv. You can now easily verify Little's formula: WIP = MLT * Flow rate = MLT / CT

25 Slide Example 4 (a)  CT for station 1?  CT for station 2?  Bottleneck?  Process Capacity?  CT for the process?  Minimum MLT? (b)  Jobs are sent to M1 every 16 minutes starting at time 0 and to M2 every 16 minutes starting at time 8. Verify Little’s formula? M1, 10 M3, 8 M2, 10

26 Slide Example 4 : Gantt Chart M1: M2: M3:

27 Slide Example 4  WIP contributions: For M1: 10 / (10 + 6) = [units] For M2: 10 / (10 + 6) = [units] For M3: 1.00 [units] Total : [units]  Each job stays in the system for 18 minutes, hence average MLT = 18 [min.] From the Gantt chart, actual CT = 8 [min. / unit]  WIP = MLT / CT = 18 [min.] / 8 [min. / unit] = [units]

28 Slide Example 5 : assembly operations  Product AA is processed at station 1 containing 2 machines in parallel. Product BB is processed at Station 2 then at station 3. One unit of AA and one unit of BB is picked from the buffer and assembled at station 4. The assembled product is then processed at station 5 containing three machines in parallel. All processing times are in minutes. M1, 9 M2, 6 X1, 3Y1, 5 P1, 4 R1, 16 R2, 18 R3, 18 S1 S2 S3 S4 S5 AA BB

29 Slide Example 5  What is the process capacity? First we need to determine the CT for each station. CT values for station 2, 3 and 4 are 3 [min/unit], 5 [min./unit] and 4 [min./unit] respectively. CT calculations for parallel machines: Find a common multiple of processing times for the station Station 1: Common multiple = 18 minutes. In 18 minutes we can process 2 jobs on M1 and 3 jobs on M2, or a total of 5. Therefore CT for station 2 = 18/5 [min/unit] = 3.6 [min./unit], Station 5: Common multiple = 144 minutes. In this time we can process 9 jobs on R1 and 8 jobs each on R2 and R3 or a total of 25. Therefore CT for station 5 = 144/25 [min/unit] = 5.76 [min/unit]. The Bottleneck is station 5 (longest CT). Therefore, the process capacity will be [60 / 5.76] ≈ 10.4 [units / hour].

30 Slide Example 5  What is the minimum MLT? One unit of AA will reach the buffer in 6 minutes (through M2) and one unit of BB will reach the buffer in 8 minutes. Thus we need at least 8 minutes before we can start the assembly at station 4. At station 5, the smallest time is 16 min. Therefore: minimum MLT = = 28 [minutes]

31 Slide Some Key insights  Capacity of a process is the maximum output rate. If input rate becomes higher than the capacity, the process will not become stable. MLT for incoming jobs will become higher and higher.  If we need to increase the capacity of any process, we need to add resources at the bottleneck stage. This may shift bottleneck to another stage.  For two schedules it is possible to have the same cycle time (output rate) but different WIP and MLT. The lower MLT and WIP the more efficient is the process.