KPI-based Schedule Optimisation M.L. van Eck. Work-related Stress Costs over €25 billion a year in the EU. (EU-OSHA) 10% of work-related illness caused.

Slides:



Advertisements
Similar presentations
From Local Patterns to Global Models: Towards Domain Driven Educational Process Mining Nikola Trčka Mykola Pechenizkiy.
Advertisements

Formal models of design 1/28 Radford, A D and Gero J S (1988). Design by Optimization in Architecture, Building, and Construction, Van Nostrand Reinhold,
Techniques to analyze workflows (design-time)
Knowledge Based Synthesis of Control for Distributed Systems Doron Peled.
1 Analysis of workflows : Verification, validation, and performance analysis. Wil van der Aalst Eindhoven University of Technology Faculty of Technology.
A university for the world real R © 2009, Chapter 3 Advanced Synchronization Moe Wynn Wil van der Aalst Arthur ter Hofstede.
Methods for Knowledge Based Controlling of Distributed Systems Saddek Bensalem, Marius Bozga, Susanne Graf, Doron Peled, Sophie Quinton.
Formal Methods for Real- Time Embedded Software Engineering 正規方法應用於即時嵌入式 軟體工程 熊博安 國立中正大學資訊工程學系 民國九十一年五月二十二日.
A tool to generate optimal schedules for complex real-time systems : Petri Net Scheduling, Modeling and Analysis of Real-Time Systems LISI-ENSMA Laboratoire.
Risk Management and Operations Solutions Derivative Pricing for Risk Calculations – Challenges and Approaches Research Workshop.
*time Optimization Heiko, Diego, Thomas, Kevin, Andreas, Jens.
Models vs. Reality dr.ir. B.F. van Dongen Assistant Professor Eindhoven University of Technology
10. Petri Nets Prof. O. Nierstrasz. Roadmap  Definition: —places, transitions, inputs, outputs —firing enabled transitions  Modelling: —concurrency.
Stochastic, Spatial and Concurrent Biological Processes Modeling Yifei Bao, Eduardo Bonelli, Philippe Bidinger, Justin Sousa, Vishakha Sharma Advisor:
Optimization for QoS on Systems with Tasks Deadlines Luis Fernando Orleans Pedro Nuno Furtado.
CP — Concurrent Programming 12. Petri Nets Prof. O. Nierstrasz Wintersemester 2005 / 2006.
1 Petri Nets H Plan: –Introduce basics of Petri Net models –Define notation and terminology used –Show examples of Petri Net models u Calaway Park model.
1 A Second Stage Network Recourse Problem in Stochastic Airline Crew Scheduling Joyce W. Yen University of Michigan John R. Birge Northwestern University.
CPN Models of Transport Systems Michal Zarnay Slovakia.
Trading optimality for speed…
1 of 20 Octopus: document handling Document handling: three modeling approaches Marc Voorhoeve Venkatesh Kannan TUE.
Models of Computation for Embedded System Design Alvise Bonivento.
1 Ivan Lanese Computer Science Department University of Bologna Italy Concurrent and located synchronizations in π-calculus.
Penn ESE535 Spring DeHon 1 ESE535: Electronic Design Automation Day 8: February 11, 2009 Dataflow.
/faculteit technologie management 1 Process Mining: Extension Mining Algorithms Ana Karla Alves de Medeiros Ana Karla Alves de Medeiros Eindhoven University.
Descriptive Modelling: Simulation “Simulation is the process of designing a model of a real system and conducting experiments with this model for the purpose.
Configuration Management
Statistical Natural Language Processing. What is NLP?  Natural Language Processing (NLP), or Computational Linguistics, is concerned with theoretical.
Fleet management and logistics
SBSE Course 4. Overview: Design Translate requirements into a representation of software Focuses on –Data structures –Architecture –Interfaces –Algorithmic.
1 A Petri Net Siphon Based Solution to Protocol-level Service Composition Mismatches Pengcheng Xiong 1, Mengchu Zhou 2 and Calton Pu 1 1 College of Computing,
Real-Time Embedded Software Synthesis 即時嵌入式軟體合成 熊博安國立中正大學資訊工程學系民國九十年十一月廿九日.
Simulation Based Production Planning, Scheduling, and Control Johannes Krauth Sim-Serv.
An Overview WMS. Benefits Faster Turnaround times Optimize your resources Reduce Paper work Seamless integration with transaction (ERP) systems Control.
Reliable Communication in the Presence of Failures Based on the paper by: Kenneth Birman and Thomas A. Joseph Cesar Talledo COEN 317 Fall 05.
Joseph Cordina 1/11 The Use of Model-Checking for the Verification of Concurrent Algorithms Joseph Cordina Department of C.S.&A.I.
Predictive Design Space Exploration Using Genetically Programmed Response Surfaces Henry Cook Department of Electrical Engineering and Computer Science.
Issues in (Financial) High Performance Computing John Darlington Director Imperial College Internet Centre Fast Financial Algorithms and Computing 4th.
Mahapatra-A&M-Fall'001 Co-design Finite State Machines Many slides of this lecture are borrowed from Margarida Jacome.
Efficiency of Alignment-based algorithms B.F. van Dongen Laziness! (Gu)estimation! Implementation effort?
Conformance Test Experiments for Distributed Real-Time Systems Rachel Cardell-Oliver Complex Systems Group Department of Computer Science & Software Engineering.
Solving Problems by searching Well defined problems A probem is well defined if it is easy to automatically asses the validity (utility) of any proposed.
Lecture 1 – Operations Research
Network design Topic 6 Testing and documentation.
Operations Research The OR Process. What is OR? It is a Process It assists Decision Makers It has a set of Tools It is applicable in many Situations.
Xiao Liu 1, Yun Yang 1, Jinjun Chen 1, Qing Wang 2, and Mingshu Li 2 1 Centre for Complex Software Systems and Services Swinburne University of Technology.
Dana Nau: Lecture slides for Automated Planning Licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License:
CAP 4800/CAP 5805: Computer Simulation Concepts
CSCI1600: Embedded and Real Time Software Lecture 28: Verification I Steven Reiss, Fall 2015.
ProShell Procedure Framework Status MedAustron Control System Week 2 October 7 th, 2010 Roland Moser PR a-RMO, October 7 th, 2010 Roland Moser 1.
What you MUST know before a database system development.
Airline Optimization Problems Constraint Technologies International
Solving the straggler problem with bounded staleness Jim Cipar, Qirong Ho, Jin Kyu Kim, Seunghak Lee, Gregory R. Ganger, Garth Gibson, Kimberly Keeton*,
Operations Research Models and Methods Advanced Operations Research Reference: Operations Research Models and Methods, Operations Research Models and Methods,
Search Control.. Planning is really really hard –Theoretically, practically But people seem ok at it What to do…. –Abstraction –Find “easy” classes of.
Static Translation of Stream Program to a Parallel System S. M. Farhad The University of Sydney.
Symbolic Model Checking of Software Nishant Sinha with Edmund Clarke, Flavio Lerda, Michael Theobald Carnegie Mellon University.
Holding slide prior to starting show. Scheduling Parametric Jobs on the Grid Jonathan Giddy
HTBN Batches These slides are intended as a starting point for further discussion of how eTime might be extended to allow easier processing of HTBN data.
Geraint Palmer Optimisation using Linear Programming.
Network Management Lecture 13. MACHINE LEARNING TECHNIQUES 2 Dr. Atiq Ahmed Université de Balouchistan.
Week 8 Computational Level
Wolfgang Runte Slide University of Osnabrueck, Software Engineering Research Group Wolfgang Runte Software Engineering Research Group Institute.
Chapter 4 – Thread Concepts
Automate Does Not Always Mean Optimize
Chapter 4 – Thread Concepts
WMS An Overview.
COT 5611 Operating Systems Design Principles Spring 2012
COT 5611 Operating Systems Design Principles Spring 2014
Presentation transcript:

KPI-based Schedule Optimisation M.L. van Eck

Work-related Stress Costs over €25 billion a year in the EU. (EU-OSHA) 10% of work-related illness caused by stress 28% workers reported to be affected by stress 80% of managers are concerned about stress in the workplace SLIDE 1

Reducing Stress SLIDE 2

Schedule Optimisation SLIDE 3 KPI Calculation Model Scheduling Approach If orderSize > 10 then Receive Shipment before Pay Invoice Handle Orders (x5 orders, 10 hours) Confirm Delivery Receive Shipment Pay Invoice Resources Anna John AnnaJohn Schedule Constraint Model Task List

Scheduling SLIDE 4 Many scheduling techniques exist Constraint programming Network models Stochastic optimization … Challenges: Interacting resources Flexible processes Concurrency Predicting resource performance Problem formulation

Schedule Optimisation SLIDE 5 KPI Calculation Model Scheduling Approach If orderSize > 10 then Receive Shipment before Pay Invoice Handle Orders (x5 orders, 10 hours) Confirm Delivery Receive Shipment Pay Invoice Resources Anna John AnnaJohn Schedule Constraints Task List

Scheduling Approach 1.Automatically construct an executable model (solution space) Activities Resources Constraints KPIs Time 2.Compute an optimal schedule using the executable model SLIDE 6

Schedule Optimisation SLIDE 7 KPI Calculation Model If orderSize > 10 then Receive Shipment before Pay Invoice Handle Orders (x5 orders, 10 hours) Confirm Delivery Receive Shipment Pay Invoice Resources Anna John AnnaJohn Schedule Constraints Task List 1. Build Executable Model 2. Find Optimal Schedule

Constraints Collection of “business rules” 1. Confirm Delivery before Receive Shipment & Pay Invoice 2. If orderSize > 10 then Receive Shipment before Pay Invoice 3. … Modelled as (Coloured) Petri Nets with multi-label transitions SLIDE

Schedule Optimisation SLIDE 9 KPI Calculation Model If orderSize > 10 then Receive Shipment before Pay Invoice Handle Orders (x5 orders, 10 hours) Confirm Delivery Receive Shipment Pay Invoice Resources Anna John AnnaJohn Schedule Constraints Task List 1. Build Executable Model 2. Find Optimal Schedule

KPI Calculation Model SLIDE 10

Schedule Optimisation SLIDE 11 KPI Calculation Model If orderSize > 10 then Receive Shipment before Pay Invoice Handle Orders (x5 orders, 10 hours) Confirm Delivery Receive Shipment Pay Invoice Resources Anna John AnnaJohn Schedule Constraints Task List 1. Build Executable Model 2. Find Optimal Schedule

Executable Model SLIDE 12 Coloured Petri Net (timed) Building the executable model 1.Create an initial net from the task list 2.Compute the multi-label synchronous product with all constraints 3.Add resources & model explicit delaying 4.Add KPI tracking Generate valid schedule by reaching final marking

Executable Model SLIDE 13

Schedule Optimisation SLIDE 14 KPI Calculation Model If orderSize > 10 then Receive Shipment before Pay Invoice Handle Orders (x5 orders, 10 hours) Confirm Delivery Receive Shipment Pay Invoice Resources Anna John AnnaJohn Schedule Constraints Task List 1. Build Executable Model 2. Find Optimal Schedule

Calculating Optimal Schedules SLIDE 15 Calculate the state space of the executable model Cost of each state is modelled in marking All final states are valid schedules Problem: Slow  Partial order reductions (Stubborn sets) don’t seem to help

Schedule Optimisation SLIDE 16 KPI Calculation Model If orderSize > 10 then Receive Shipment before Pay Invoice Handle Orders (x5 orders, 10 hours) Confirm Delivery Receive Shipment Pay Invoice Resources Anna John AnnaJohn Schedule Constraints Task List 1. Build Executable Model 2. Find Optimal Schedule

Future Work SLIDE 17 Finding optimal schedules Settle for non-optimal schedules Translate executable model into e.g. constraint program Calculate state space using LoLA Constraint mining Compute a set of schedules Classify into “good” and “bad” Learn additional constraints to guarantee better schedules

SLIDE 18 Questions?

Running Example SLIDE 19 Anna & John Order Handling Process Office Warehouse

Combining Petri Nets Standard synchronous product SLIDE 20 D

Multi-label Synchronous Product SLIDE 21 All labels need to be matched * = any value

Multi-label Synchronous Product SLIDE 22

Multi-label Synchronous Product SLIDE 23

Challenges & Future Work Calculating the statespace is slow Many parallel activities Coloured tokens to model order IDs, resource use, time, costs, etc. Implement multidimensional cost functions E.g. maximise throughput time & minimise stress (Pareto front) Non-linear cost functions are no problem User-friendly restrictions model specification SLIDE 24