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

Slides:

Advertisements

Similar presentations

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

Advertisements

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.

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.

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.

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.

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.

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

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.

/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.

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.

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.

Performance Evaluation of Peer-to-Peer Video Streaming Systems Wilson, W.F. Poon The Chinese University of Hong Kong.

Grid Load Balancing Scheduling Algorithm Based on Statistics Thinking The 9th International Conference for Young Computer Scientists Bin Lu, Hongbin Zhang.

Investigation of TDMA solution for the hidden terminal problem (With “ Wavion ” ) Final Report Presentation.

/faculteit technologie management DEMO CPN-tools Ronny Mans Eindhoven University of Technology, Faculty of Technology Management, Department of Information.

A Tool for Describing and Evaluating Hierarchical Real-Time Bus Scheduling Policies Author: Trevor Meyerowitz, Claudio Pinello, Alberto DAC2003, June 24,2003.

A university for the world real R © 2009, Chapter 17 Process Mining and Simulation Moe Wynn Anne Rozinat Wil van der Aalst Arthur.

The participants should have understood the following basic principles: Integrating gender considerations into project design and implementation Assessing.

A university for the world real R © 2009, Chapter 23 Epilogue Wil van der Aalst Michael Adams Arthur ter Hofstede Nick Russell.

Self-Organizing Agents for Grid Load Balancing Junwei Cao Fifth IEEE/ACM International Workshop on Grid Computing (GRID'04)

Unit 2: Engineering Design Process

Efficient Scheduling of Heterogeneous Continuous Queries Mohamed A. Sharaf Panos K. Chrysanthis Alexandros Labrinidis Kirk Pruhs Advanced Data Management.

Introduction to Discrete Event Simulation Customer population Service system Served customers Waiting line Priority rule Service facilities Figure C.1.

Lottery Scheduling: Flexible Proportional-Share Resource Management Sim YounSeok C. A. Waldspurger and W. E. Weihl.

/ Copyright © Siemens AG All rights reserved. Corporate Technology Performance Prediction of Client-Server Systems by High-Level Abstraction Models.

Lecture 2 Process Concepts, Performance Measures and Evaluation Techniques.

Distributing Layered Encoded Video through Caches Authors: Jussi Kangasharju Felix HartantoMartin Reisslein Keith W. Ross Proceedings of IEEE Infocom 2001,

1 Performance Evaluation of Computer Systems and Networks Introduction, Outlines, Class Policy Instructor: A. Ghasemi Many thanks to Dr. Behzad Akbari.

1 (Re)designing workflows Tips and tricks. Wil van der Aalst Eindhoven University of Technology Faculty of Technology Management Department of Information.

Modeling. Conceptual modeling: Petri nets Implementation: Arena, CPN tools Simulation needed: build models. Start with concepts, then select appropriate.

Business Process Change and Discrete-Event Simulation: Bridging the Gap Vlatka Hlupic Brunel University Centre for Re-engineering Business Processes (REBUS)

1 Analysis of workflows : Verification, validation, and performance analysis. Wil van der Aalst Eindhoven University of Technology Faculty of Technology.

Workflow Management Kap. 6. Roadmap for Workflows = Design of Workflow Systems Wil van der Aalst has copyrights to almost all figures in the following.

9 th International Workshop on Intuitionistic Fuzzy Sets and Generalized Nets, 8 October 2010, Warsaw, Poland Utilizing the Model Graphic Structures when.

Operating System 9 UNIPROCESSOR SCHEDULING. TYPES OF PROCESSOR SCHEDULING.

Parametric Optimization Of Some Critical Operating System Functions An Alternative Approach To The Study Of Operating Systems Design.

Berlin, December 11 th 2012 Faculty of Mechanical Engineering · Chair of Logistics Engineering Network Optimization prior to Dynamic Simulation of AMHS.

LECTURE 02: EVALUATING MODELS January 27, 2016 SDS 293 Machine Learning.

A university for the world real R © 2009, Chapter 12 The Declare Service Maja Pesic Helen Schonenberg Wil M.P. van der Aalst.

Courtesy Piggybacking: Supporting Differentiated Services in Multihop Mobile Ad Hoc Networks Wei LiuXiang Chen Yuguang Fang WING Dept. of ECE University.

Net Neutrality and Quality of Service. OVERVIEW Transparency and more strict regulation IAS versus specialized services NN and monitoring of overall IAS.

1 The academic discourse - a challenge for both students and teachers Leif Karlsson, Kristianstad University, Learning Resource Centre Bodil Lennvig, Kristianstad.

Chapter 33 Introduction to the Nursing Process

Introduction to Load Balancing:

Profiling based unstructured process logs

Unit 6 Research Project in HSC Unit 6 Research Project in Health and Social Care Aim This unit aims to develop learners’ skills of independent enquiry.

Chapter 8 – Processor Scheduling

Manufacturing system design (MSD)

Lottery Scheduling: Flexible Proportional-Share Resource Management

Lottery Scheduling Ish Baid.

Prepared by Lee Revere and John Large

Wil van der Aalst Eindhoven University of Technology

Chapter 5: CPU Scheduling

Wil van der Aalst Eindhoven University of Technology

Operating systems Process scheduling.

Petri nets refresher Prof.dr.ir. Wil van der Aalst

CPU SCHEDULING.

Wil van der Aalst Eindhoven University of Technology

Operating System 9 UNIPROCESSOR SCHEDULING

Distance students’ preference for type of tutorial participation

Research Paper Overview.

Presentation transcript:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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[ ; ]0.84 1[ ; ]0.89 2[ ; ]0.89 3[ ; ]0.92 4[ ; ]0.93 5[ ; ]0.94

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[ ; ]0.84 1a[ ; ]0.86 1b[ ; ]0.86 1[ ; ]0.89 2[ ; ]0.89 3[ ; ]0.92 4[ ; ]0.93 5[ ; ]0.94

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

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)

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

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[ ; ]0.84[ ; ]0.84 1a[ ; ]0.87[ ; ]0.86 1b[ ; ]0.87[ ; ]0.86 1[ ; ]0.88[ ; ]0.89 2[ ; ]0.90[ ; ]0.89 3[ ; ]0.93[ ; ]0.92 4[ ; ]0.92[ ; ]0.93 5[ ; ]0.94[ ; ]0.94

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 [ ; ] [ ; ] Random Flexible [ ; ] [ ; ] cases per hour 3Random Flexible [ ; ] [ ; ] Random Flexible [ ; ] [ ; ]

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

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

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

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

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

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