Marlon Dumas marlon.dumas ät ut . ee

Slides:



Advertisements
Similar presentations
TWO STEP EQUATIONS 1. SOLVE FOR X 2. DO THE ADDITION STEP FIRST
Advertisements

Chapter 5: CPU Scheduling
Advanced Piloting Cruise Plot.
Copyright © 2002 Pearson Education, Inc. Slide 1.
© 2008 Pearson Addison Wesley. All rights reserved Chapter Seven Costs.
Copyright © 2002 Pearson Education, Inc. Slide 1.
Operations Scheduling
1 Copyright © 2010, Elsevier Inc. All rights Reserved Fig 2.1 Chapter 2.
By D. Fisher Geometric Transformations. Reflection, Rotation, or Translation 1.
Business Transaction Management Software for Application Coordination 1 Business Processes and Coordination.
and 6.855J Cycle Canceling Algorithm. 2 A minimum cost flow problem , $4 20, $1 20, $2 25, $2 25, $5 20, $6 30, $
Tuesday, May 7 Integer Programming Formulations Handouts: Lecture Notes.
Summary of Convergence Tests for Series and Solved Problems
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Title Subtitle.
Exit a Customer Chapter 8. Exit a Customer 8-2 Objectives Perform exit summary process consisting of the following steps: Review service records Close.
0 - 0.
DIVIDING INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
ADDING INTEGERS 1. POS. + POS. = POS. 2. NEG. + NEG. = NEG. 3. POS. + NEG. OR NEG. + POS. SUBTRACT TAKE SIGN OF BIGGER ABSOLUTE VALUE.
SUBTRACTING INTEGERS 1. CHANGE THE SUBTRACTION SIGN TO ADDITION
MULT. INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
Addition Facts
Chapter 1 Review __________________ is the study of how people seek to satisfy their needs and wants by making choices. A physical object such as a shirt,
1 Learning Touchmath *Graphics taken from
Year 6 mental test 5 second questions
ZMQS ZMQS
Learning Objectives for Section 3.2
BT Wholesale October Creating your own telephone network WHOLESALE CALLS LINE ASSOCIATED.
Notes 15 ECE Microwave Engineering
Introduction When you choose a restaurant for a meal, are you concerned with: The price of the meal How long you have to wait to be seated The quality.
Chapter 4 Memory Management Basic memory management Swapping
ABC Technology Project
Hash Tables.
Capacity Planning For Products and Services
Capacity Planning For Products and Services
Process Capacity.
VOORBLAD.
FI3300 Corporation Finance Spring Semester 2010 Dr. Isabel Tkatch Assistant Professor of Finance 1.
2009 Foster School of Business Cost Accounting L.DuCharme 1 Decision Making and Relevant Information Chapter 11.
Linking Verb? Action Verb or. Question 1 Define the term: action verb.
Squares and Square Root WALK. Solve each problem REVIEW:
We are learning how to read the 24 hour clock
Do you have the Maths Factor?. Maths Can you beat this term’s Maths Challenge?
© 2012 National Heart Foundation of Australia. Slide 2.
Lets play bingo!!. Calculate: MEAN Calculate: MEDIAN
Chapter 5 Test Review Sections 5-1 through 5-4.
GG Consulting, LLC I-SUITE. Source: TEA SHARS Frequently asked questions 2.
Addition 1’s to 20.
25 seconds left…...
Test B, 100 Subtraction Facts
A Closer Look at Food Cost
Week 1.
1. 2 No lecture on Wed February 8th Thursday 9 th Feb Friday 27 th Jan Friday 10 th Feb Thursday 14: :00 Friday 16:00 – 19:00 HS N.
We will resume in: 25 Minutes.
Less Than Matching Orgad Keller.
Chapter 15: Quantitatve Methods in Health Care Management Yasar A. Ozcan 1 Chapter 15. Simulation.
1 Unit 1 Kinematics Chapter 1 Day
PSSA Preparation.
1 PART 1 ILLUSTRATION OF DOCUMENTS  Brief introduction to the documents contained in the envelope  Detailed clarification of the documents content.
How Cells Obtain Energy from Food
Managing Process Flows
BIS 494: Topics in Information Systems 1 Managing Process Flows Chapter 5 Business Process Modeling, Simulation and Design.
Marlon Dumas marlon.dumas ät ut . ee
Marlon Dumas marlon.dumas ät ut . ee
MTAT Business Process Management Lecture 6 – Quantitative Process Analysis II Marlon Dumas marlon.dumas ät ut. ee 1.
1 BIS 3106: Business Process Management (BPM) Lecture Eight: Quantitative Process Analysis (1) Makerere University School of Computing and Informatics.
Marlon Dumas marlon.dumas ät ut . ee
Chapter 7: Quantitative Process Analysis
Presentation transcript:

Marlon Dumas marlon.dumas ät ut . ee MTAT.03.231 Business Process Management (BPM) Lecture 5: Quantitative Process Analysis Marlon Dumas marlon.dumas ät ut . ee

Business Process Analysis

Process Analysis Techniques Qualitative analysis Value-Added Analysis Root-Cause Analysis Pareto Analysis Issue Register Quantitative Analysis Quantitative Flow Analysis Queuing Theory Process Simulation

Process Performance Measures Link the identified processes to measurable objectives Quantify the benefits of improvement Profit maximizing firms Non-profit organizations Maximize long term shareholder value Survive and grow while satisfying customer needs Maximize revenues and minimize costs Use resources efficiently while satisfying customer needs Satisfy customer needs (effectiveness) in an efficient way (efficiency) Inspired by a slide by Manuel Laguna & John Marklund

Fill in the blanks If you had to choose between two services, you would typically choose the one that is: F… B… C…

Process Performance Measures Cost Cost per execution Resource utilization Waste Time Cycle time Waiting time / time spent in non-value-added tasks Quality Error rates (negative outcomes, wrong info) Missed promise

Let’s start with time Mark McGuinness: Time Management for Creative People

Cycle Time Analysis Cycle time: Difference between a job’s start and end time Cycle time analysis: the task of calculating the average cycle time for an entire process or process fragment Assumes that the average activity times for all involved activities are available (activity time = waiting time + processing time) In the simplest case a process consists of a sequence of activities on a sequential path The average cycle time is the sum of the average activity times … but in general we must be able to account for Alternative paths (XOR splits) Parallel paths (AND splits) Rework (cycles)

Alternative Paths CT = p1T1+p2T2+…+pnTn = Inspired by a slide by Manuel Laguna & John Marklund

Alternative Paths – Example What is the average cycle time?

Parallel Paths If two activities related to the same job are done in parallel the contribution to the cycle time for the job is the maximum of the two activity times. CTparallel = Max{T1, T2,…, TM} Inspired by a slide by Manuel Laguna & John Marklund

Parallel Paths – Example What is the average cycle time?

Rework Many processes include control or inspection points where if the job does not meet certain standard, it is sent back for rework CT = T/(1-r)

Rework – Example What is the average cycle time?

Rework At Most Once – Example What is the average cycle time?

Quick exercise Calculate cycle time

Cycle Time Efficiency Measured as the percentage of the total cycle time spent on value adding activities. CT = cycle time as defined before Theoretical Cycle Time (TCT) is the cycle time if we only counted value-adding activities and excluded any waiting time or handover time Count only processing times Cycle Time Efficiency = After this slide it is suitable with a larger example of Cycle Time Analysis, for example, Problems 9 & 10, Chapter 4 in Laguna. Inspired by a slide by Manuel Laguna & John Marklund

Flow Analysis The previous technique for cycle time analysis is only one example of what can be done using flow analysis techniques Other applications: Calculating cost-per-process-instance (cf. Textbook) Calculating error rates at the process level Estimating capacity requirements

Limitation 1: Not all Models are Structured 0.3 0.5 0.7 0.8 0.5 0.2

Limitation 2: Fixed load + fixed resource capacity Cycle time analysis does not consider waiting times due to resource contention Queuing analysis and simulation address these limitations and have a broader applicability

Cycle Time & Work-In-Progress WIP = (average) Work-In-Process Number of cases that are running (started but not yet completed) E.g. # of active and unfilled orders in an order-to-cash process WIP is a form of waste (cf. 7+1 sources of waste) Little’s Formula: WIP = ·CT  = arrival rate (number of new cases per time unit) CT = cycle time

Exercise A fast-food restaurant receives on average 1200 customers per day (between 10:00 and 22:00). During peak times (12:00-15:00 and 18:00-21:00), the restaurant receives around 900 customers in total, and 90 customers can be found in the restaurant (on average) at a given point in time. At non-peak times, the restaurant receives 300 customers in total, and 30 customers can be found in the restaurant (on average) at a given point in time. What is the average time that a customer spends in the restaurant during peak times? What is the average time that a customer spends in the restaurant during non-peak times?

Exercise (cont.) The restaurant plans to launch a marketing campaign to attract more customers. However, the restaurant’s capacity is limited and becomes too full during peak times. What can the restaurant do to address this issue without investing in extending its building?