Presentation is loading. Please wait.

Presentation is loading. Please wait.

Mariska Netjes, Wil M.P. van der Aalst, Hajo A. Reijers - Analysis of resource-constrained processes with Colored Petri Nets CPN Workshop 2005 Analysis.

Published by Modified over 9 years ago

Similar presentations

Presentation on theme: "Mariska Netjes, Wil M.P. van der Aalst, Hajo A. Reijers - Analysis of resource-constrained processes with Colored Petri Nets CPN Workshop 2005 Analysis."— Presentation transcript:

1 Mariska Netjes, Wil M.P. van der Aalst, Hajo A. Reijers - Analysis of resource-constrained processes with Colored Petri Nets CPN Workshop 2005 Analysis of resource-constrained processes with Colored Petri Nets Mariska Netjes Wil M.P. van der Aalst Hajo A. Reijers

2 Mariska Netjes, Wil M.P. van der Aalst, Hajo A. Reijers - Analysis of resource-constrained processes with Colored Petri Nets CPN Workshop 2005 Outline Introduction Developed CPN model Application of the CPN model Conclusions Reflection

3 Mariska Netjes, Wil M.P. van der Aalst, Hajo A. Reijers - Analysis of resource-constrained processes with Colored Petri Nets CPN Workshop 2005 Introduction (1) Business Process Redesign: improving performance with process oriented redesign From literature best practices for business process improvement are collected by H.A. Reijers & S. Limam Mansar, 2005 1 It should be noted that many of the best practices lack adequate (quantitative) support 1. H.A. Reijers, S. Limam Mansar. Best practices in business process redesign. Omega (33.4), 2005

4 Mariska Netjes, Wil M.P. van der Aalst, Hajo A. Reijers - Analysis of resource-constrained processes with Colored Petri Nets CPN Workshop 2005 Introduction (2) We investigate two of these best practices Both best practices aim at the improvement of resource-constrained processes We built a CPN model to: –provide an easy way to model a resource-constrained process and –change it to evaluate best practices under different circumstances –with simulation

5 Mariska Netjes, Wil M.P. van der Aalst, Hajo A. Reijers - Analysis of resource-constrained processes with Colored Petri Nets CPN Workshop 2005 Outline Introduction Developed CPN model Application of the CPN model Conclusions Reflection

6 Mariska Netjes, Wil M.P. van der Aalst, Hajo A. Reijers - Analysis of resource-constrained processes with Colored Petri Nets CPN Workshop 2005 CPN model – overview

7 Mariska Netjes, Wil M.P. van der Aalst, Hajo A. Reijers - Analysis of resource-constrained processes with Colored Petri Nets CPN Workshop 2005 CPN model – task building block

8 Mariska Netjes, Wil M.P. van der Aalst, Hajo A. Reijers - Analysis of resource-constrained processes with Colored Petri Nets CPN Workshop 2005 CPN model – resource module

9 Mariska Netjes, Wil M.P. van der Aalst, Hajo A. Reijers - Analysis of resource-constrained processes with Colored Petri Nets CPN Workshop 2005 CPN model – resource allocation methods Random allocation from all the available resources with a suitable role one is randomly selected Priority based allocation the available resource with the highest priority role is selected

10 Mariska Netjes, Wil M.P. van der Aalst, Hajo A. Reijers - Analysis of resource-constrained processes with Colored Petri Nets CPN Workshop 2005 Outline Introduction Developed CPN model Application of the CPN model Conclusions Reflection

11 Mariska Netjes, Wil M.P. van der Aalst, Hajo A. Reijers - Analysis of resource-constrained processes with Colored Petri Nets CPN Workshop 2005 Example process: opening a bank account

12 Mariska Netjes, Wil M.P. van der Aalst, Hajo A. Reijers - Analysis of resource-constrained processes with Colored Petri Nets CPN Workshop 2005 The use of monitors

13 Mariska Netjes, Wil M.P. van der Aalst, Hajo A. Reijers - Analysis of resource-constrained processes with Colored Petri Nets CPN Workshop 2005

14 Mariska Netjes, Wil M.P. van der Aalst, Hajo A. Reijers - Analysis of resource-constrained processes with Colored Petri Nets CPN Workshop 2005 Specialist - generalist trade-off (1) Two mechanisms –specialist performs the work faster –generalist can perform more tasks Performance indicator = average throughput time Allocation method = random assignment Optimal ratio of specialists and generalists –too many alternatives to evaluate and compare –find a distinctive ratio –global search and further investigation

15 Mariska Netjes, Wil M.P. van der Aalst, Hajo A. Reijers - Analysis of resource-constrained processes with Colored Petri Nets CPN Workshop 2005 Specialist - generalist trade-off (2) AlternativesThroughput timeUtilization rate 0[ 16.134 ; 18.604 ]0.84 1[ 14.541 ; 16.451 ]0.89 2[ 16.438 ; 19.086 ]0.89 3[ 29.694 ; 34.838 ]0.92 4[ 36.390 ; 43.550 ]0.93 5[ 51.831 ; 58.895 ]0.94

16 Mariska Netjes, Wil M.P. van der Aalst, Hajo A. Reijers - Analysis of resource-constrained processes with Colored Petri Nets CPN Workshop 2005 Specialist - generalist trade-off (3) AlternativesThroughput timeUtilization rate 0[ 16.134 ; 18.604 ]0.84 1a[ 13.529 ; 14.867 ]0.86 1b[ 13.852 ; 15.538 ]0.86 1[ 14.541 ; 16.451 ]0.89 2[ 16.438 ; 19.086 ]0.89 3[ 29.694 ; 34.838 ]0.92 4[ 36.390 ; 43.550 ]0.93 5[ 51.831 ; 58.895 ]0.94

17 Mariska Netjes, Wil M.P. van der Aalst, Hajo A. Reijers - Analysis of resource-constrained processes with Colored Petri Nets CPN Workshop 2005 Specialist - generalist trade-off (4) Conclusions A ratio with mainly specialists and one or a few generalists will provide the best trade-off between the shorter service times of the specialist and the flexibility offered by the generalist. Preconditions for finding a distinctive ratio: –high resource utilization –proportional distribution of specialized resources –service times should not differ too much

18 Mariska Netjes, Wil M.P. van der Aalst, Hajo A. Reijers - Analysis of resource-constrained processes with Colored Petri Nets CPN Workshop 2005 Flexible assignment policy (1)

19 Mariska Netjes, Wil M.P. van der Aalst, Hajo A. Reijers - Analysis of resource-constrained processes with Colored Petri Nets CPN Workshop 2005 Flexible assignment policy (2) Flexible assignment  random assignment Our expectations: initial process performs the same more specialists than generalists: almost equal selection, minor differences more generalists than specialists: more specialists allocated, lower queueing and service times for the process

20 Mariska Netjes, Wil M.P. van der Aalst, Hajo A. Reijers - Analysis of resource-constrained processes with Colored Petri Nets CPN Workshop 2005 Flexible assignment policy (3) Flexible assignmentRandom assignment Alt.Throughput timeUt. rateThroughput timeUt. rate 0[ 16.703 ; 19.731 ]0.84[ 16.134 ; 18.604 ]0.84 1a[ 14.066 ; 16.158 ]0.87[ 13.529 ; 14.867 ]0.86 1b[ 14.149 ; 15.687 ]0.87[ 13.852 ; 15.538 ]0.86 1[ 14.569 ; 16.613 ]0.88[ 14.541 ; 16.451 ]0.89 2[ 15.817 ; 17.410 ]0.90[ 16.438 ; 19.086 ]0.89 3[ 29.131 ; 34.279 ]0.93[ 29.694 ; 34.838 ]0.92 4[ 38.070 ; 44.872 ]0.92[ 36.390 ; 43.550 ]0.93 5[ 47.594 ; 54.428 ]0.94[ 51.831 ; 58.895 ]0.94

21 Mariska Netjes, Wil M.P. van der Aalst, Hajo A. Reijers - Analysis of resource-constrained processes with Colored Petri Nets CPN Workshop 2005 Flexible assignment policy (4) New simulations for alternatives 3 and 4 with less cases arriving to lower the utilization rate. Arrival rateAlt.Allocation method Throughput timeUt. rate 120 cases per hour 3Random Flexible [ 12.075 ; 12.249 ] [ 11.312 ; 11.478 ] 0.64 0.60 4Random Flexible [ 12.489 ; 12.647 ] [ 11.707 ; 11.993 ] 0.67 0.62 150 cases per hour 3Random Flexible [ 12.276 ; 12.614 ] [ 11.814 ; 12.186 ] 0.78 0.76 4Random Flexible [ 13.076 ; 13.664 ] [ 12.563 ; 13.019 ] 0.81 0.79

22 Mariska Netjes, Wil M.P. van der Aalst, Hajo A. Reijers - Analysis of resource-constrained processes with Colored Petri Nets CPN Workshop 2005 Flexible assignment policy (5) Conclusions Flexible assignment can improve a process with both specialized and generic resources Preconditions to benefit from flexible assignment: –the process is not loaded too heavily –extra benefit when the specialists work faster than the generalists

23 Mariska Netjes, Wil M.P. van der Aalst, Hajo A. Reijers - Analysis of resource-constrained processes with Colored Petri Nets CPN Workshop 2005 Outline Introduction Developed CPN model Application of the CPN model Conclusions Reflection

24 Mariska Netjes, Wil M.P. van der Aalst, Hajo A. Reijers - Analysis of resource-constrained processes with Colored Petri Nets CPN Workshop 2005 Conclusions The developed CPN model was useful and easy to change Specialist-generalist trade-off: the best ratio is one with mainly specialists and one or a few generalists Flexible assignment: improvement, especially when more generalists than specialists are availabe Same mechanisms, but opposite working

25 Mariska Netjes, Wil M.P. van der Aalst, Hajo A. Reijers - Analysis of resource-constrained processes with Colored Petri Nets CPN Workshop 2005 Outline Introduction Developed CPN model Application of the CPN model Conclusions Reflection

26 Mariska Netjes, Wil M.P. van der Aalst, Hajo A. Reijers - Analysis of resource-constrained processes with Colored Petri Nets CPN Workshop 2005 Reflection on project Characteristics of project: ideas and modelling the first ideas: more people further development and application: mainly 1 person first time using CPN Tools (version 1.2.0) 3 weeks of modelling (development) 1 week of analysis (application) Difficulties: Many internal errors in the beginning Lack of programming skills

27 Mariska Netjes, Wil M.P. van der Aalst, Hajo A. Reijers - Analysis of resource-constrained processes with Colored Petri Nets CPN Workshop 2005 The End

Download ppt "Mariska Netjes, Wil M.P. van der Aalst, Hajo A. Reijers - Analysis of resource-constrained processes with Colored Petri Nets CPN Workshop 2005 Analysis."

Similar presentations

Dynamic Thread Assignment on Heterogeneous Multiprocessor Architectures Pree Thiengburanathum Advanced computer architecture Oct 24, 2007 1.

Dynamic Thread Assignment on Heterogeneous Multiprocessor Architectures Pree Thiengburanathum Advanced computer architecture Oct 24,
1 Analysis of workflows : Verification, validation, and performance analysis. Wil van der Aalst Eindhoven University of Technology Faculty of Technology.

1 Analysis of workflows : Verification, validation, and performance analysis. Wil van der Aalst Eindhoven University of Technology Faculty of Technology.
1 An Adaptive GA for Multi Objective Flexible Manufacturing Systems A. Younes, H. Ghenniwa, S. Areibi uoguelph.ca.

1 An Adaptive GA for Multi Objective Flexible Manufacturing Systems A. Younes, H. Ghenniwa, S. Areibi uoguelph.ca.
Software and Systems Engineering Seminar Winter 2011 Domain-specific languages in model-driven software engineering 1 Speaker: Valentin ROBERT.

Software and Systems Engineering Seminar Winter 2011 Domain-specific languages in model-driven software engineering 1 Speaker: Valentin ROBERT.
Finding the best in the family Schunselaar, Verbeek, Van der Aalst, Reijers.

Finding the best in the family Schunselaar, Verbeek, Van der Aalst, Reijers.
Process Mining in the Context of Web Services Prof.dr.ir. Wil van der Aalst Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands.

Process Mining in the Context of Web Services Prof.dr.ir. Wil van der Aalst Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands.
Workflow Management Kap. 4. Analyzing Workflows Wil van der Aalst has copyrights to almost all figures in the following slideshow made by Lars Frank.

Workflow Management Kap. 4. Analyzing Workflows Wil van der Aalst has copyrights to almost all figures in the following slideshow made by Lars Frank.
Appendix A The Future of Workflows Wil van der Aalst has copyrights to almost all figures in the following slideshow made by Lars Frank.

Appendix A The Future of Workflows Wil van der Aalst has copyrights to almost all figures in the following slideshow made by Lars Frank.
S. Chopra/Operations/Managing Services1 Operations Management: Capacity Management in Services Module u Why do queues build up? u Process attributes and.

S. Chopra/Operations/Managing Services1 Operations Management: Capacity Management in Services Module u Why do queues build up? u Process attributes and.
Why static is bad! Hadoop Pregel MPI Shared cluster Today: static partitioningWant dynamic sharing.

Why static is bad! Hadoop Pregel MPI Shared cluster Today: static partitioningWant dynamic sharing.
Host Load Trace Replay Peter A. Dinda Thesis Seminar 11/23/98.

Host Load Trace Replay Peter A. Dinda Thesis Seminar 11/23/98.
Fast Filter Updates for Packet Classification using TCAM Authors: Haoyu Song, Jonathan Turner. Publisher: GLOBECOM 2006, IEEE Present: Chen-Yu Lin Date:

Fast Filter Updates for Packet Classification using TCAM Authors: Haoyu Song, Jonathan Turner. Publisher: GLOBECOM 2006, IEEE Present: Chen-Yu Lin Date:
Project 2 – solution code

Project 2 – solution code
Performance Analysis and Monitoring Facilities in CPN Tools Tutorial CPN’05 October 25, 2005 Lisa Wells.

Performance Analysis and Monitoring Facilities in CPN Tools Tutorial CPN’05 October 25, 2005 Lisa Wells.
1 Analysis of workflows a-priori and a-posteriori analysis Wil van der Aalst Eindhoven University of Technology Faculty of Technology Management Department.

1 Analysis of workflows a-priori and a-posteriori analysis Wil van der Aalst Eindhoven University of Technology Faculty of Technology Management Department.
/faculteit technologie management Business Process Simulation A Tool Survey Monique Jansen-Vullers Mariska Netjes.

/faculteit technologie management Business Process Simulation A Tool Survey Monique Jansen-Vullers Mariska Netjes.
1 Performance Evaluation of Computer Networks Objectives  Introduction to Queuing Theory  Little’s Theorem  Standard Notation of Queuing Systems  Poisson.

1 Performance Evaluation of Computer Networks Objectives  Introduction to Queuing Theory  Little’s Theorem  Standard Notation of Queuing Systems  Poisson.
Elements of Planning and Decision-Making

Elements of Planning and Decision-Making
1 Introduction to Load Balancing: l Definition of Distributed systems. Collection of independent loosely coupled computing resources. l Load Balancing.

1 Introduction to Load Balancing: l Definition of Distributed systems. Collection of independent loosely coupled computing resources. l Load Balancing.
1212 / t 1 A SHORT TERM CAPACITY ADJUSTMENT POLICY FOR MINIMIZING LATENESS IN JOB SHOP PODUCTION SYSTEMS Henny P.G. van Ooijen J.Will M. Bertrand.

1212 / t 1 A SHORT TERM CAPACITY ADJUSTMENT POLICY FOR MINIMIZING LATENESS IN JOB SHOP PODUCTION SYSTEMS Henny P.G. van Ooijen J.Will M. Bertrand.

Similar presentations

Ads by Google