Marlon Dumas marlon.dumas ät ut . ee

Slides:



Advertisements
Similar presentations
Marlon Dumas marlon.dumas ät ut . ee
Advertisements

Chapter 13 Queueing Models
1 Analysis of workflows : Verification, validation, and performance analysis. Wil van der Aalst Eindhoven University of Technology Faculty of Technology.
1 Slide Process Analysis Fundamentals MGT Slide Process Definition  A process is a collection of operations connected by a flow of transactions.
Computer Architecture and the Fetch-Execute Cycle Parallel Processor Systems.
Process Design and Analysis
Workflow Management Kap. 4. Analyzing Workflows Wil van der Aalst has copyrights to almost all figures in the following slideshow made by Lars Frank.
11–1. 11–2 Chapter Eleven Copyright © 2014 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin.
Marlon Dumas marlon.dumas ät ut . ee
Business Process Modelling -9.2/ Marcello La Rosa Queensland University of Technology Brisbane, 19 September 2013.
MBA 8452 Systems and Operations Management
Allocating Memory.
Healthcare Operations Management © 2008 Health Administration Press. All rights reserved. 1.
Queuing Analysis Based on noted from Appendix A of Stallings Operating System text 6/10/20151.
Scheduling in Batch Systems
Process Analysis and Applications Module
Arquitectura de Sistemas Paralelos e Distribuídos Paulo Marques Dep. Eng. Informática – Universidade de Coimbra Ago/ Quantitative.
from Prof. Goldsman’s lecture notes
Data Communication and Networks Lecture 13 Performance December 9, 2004 Joseph Conron Computer Science Department New York University
Managing Process Flows
What we will cover…  CPU Scheduling  Basic Concepts  Scheduling Criteria  Scheduling Algorithms  Evaluations 1-1 Lecture 4.
Copyright © 1998 Wanda Kunkle Computer Organization 1 Chapter 2.1 Introduction.
14-1. Copyright © 2006 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin 14 Capacity Planning and Queuing Models.
Ch 3 Manufacturing Models and Metrics
Operations Management Week 01 Adapted from Operations Management by William J. Stevenson.
Chapter 6, Process-Flow Analysis
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
Product layout Assembly-line balancing approach. 2 Facility layout Process terminology Cycle time: Average time between completions of successive units.
Operations Managment Kristen’s Cookie - Lecture 4 (Chapters 4 and 5)
QueueTraffic and queuing theory +. 2 Queues in everyday life You have certainly been in a queue somewhere. –Where? –How were they different?  We encounter.
Marlon Dumas marlon.dumas ät ut . ee
Lecture 2 Process Concepts, Performance Measures and Evaluation Techniques.
Marlon Dumas marlon.dumas ät ut . ee
MTAT Business Process Management (BPM) Lecture 6 Qualitative Process Analysis Marlon Dumas marlon.dumas ät ut. ee.
Lecture 14 – Queuing Networks Topics Description of Jackson networks Equations for computing internal arrival rates Examples: computation center, job shop.
Queueing Analysis of Production Systems (Factory Physics)
1 1 Slide Short – Term Scheduling Professor Ahmadi.
10/19/2015Erkay Savas1 Performance Computer Architecture – CS401 Erkay Savas Sabanci University.
Introduction to Queueing Theory
Business Process Analysis
OMSAN LOJİSTİK. Production and Operations Management 2: Process Flow Fundamentals Top Management Program in Logistics & Supply Chain Management (TMPLSM)
1 Dr. Ali Amiri TCOM 5143 Lecture 8 Capacity Assignment in Centralized Networks.
IE450 Models Relating Cycle-time, Throughput, WIP and Batch Sizes
MINGZHE HAN (CMP TUTOR) COMM 204 Review Session. Outline T ABLE OF C ONTENT (Basic Information) (Process Analysis) (Multiple Types and the Product Process.
Marlon Dumas University of Tartu
Solved Problem An inspection station for assembling printers receives 40 printers/hour and has two inspectors, each of whom can inspect 30 printers per.
MTAT Business Process Management (BPM) (for Masters of ETM) Lecture 2: Process Analysis & Re-Design Marlon Dumas marlon.dumas ät ut. ee.
MTAT Business Process Management Lecture 2 – Process Modeling I Marlon Dumas marlon.dumas ät ut. ee 1.
1 BIS 3106: Business Process Management (BPM) Lecture Nine: Quantitative Process Analysis (2) Makerere University School of Computing and Informatics Technology.
MTAT Business Process Management Lecture 6 – Quantitative Process Analysis II Marlon Dumas marlon.dumas ät ut. ee 1.
MTAT Business Process Management Lecture 4 – Qualitative Process Analysis Marlon Dumas marlon.dumas ät ut. ee 1.
MTAT Business Process Management Lecture 3 – Process Modeling II Marlon Dumas marlon.dumas ät ut. ee 1.
Basic Concepts Maximum CPU utilization obtained with multiprogramming
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
Marlon Dumas marlon.dumas ät ut . ee
Your own footer Your Logo.
Lecture 14 – Queuing Networks
Analytical Tools for Process Analysis and Improvement
Marlon Dumas marlon.dumas ät ut . ee
Chapter 7: Quantitative Process Analysis
Marlon Dumas marlon.dumas ät ut . ee
Concurrent Systems Modeling using Petri Nets – Part II
Marlon Dumas marlon.dumas ät ut . ee
Queuing Models and Capacity Planning
Lecture 14 – Queuing Networks
TIME BASED COMPETITION
NET 424: REAL-TIME SYSTEMS (Practical Part)
Waiting Line Models Waiting takes place in virtually every productive process or service. Since the time spent by people and things waiting in line is.
Presentation transcript:

Marlon Dumas marlon.dumas ät ut . ee MTAT.03.231 Business Process Management (BPM) Lecture 4: 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

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 per execution Resource utilization Waste Cost Cycle time Waiting time / time spent in non-value-added tasks Time Error rates (negative outcomes, wrong info) Missed promise Quality

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?

In 60% of the cases the credit is granted

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

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 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?