These slides are done for the presentation of my diploma thesis. (English)

1. Diploma Thesis Martin Homik Resource Optimization of Workflow Problems Tutors: Christian Schulte Tobias Müller

9. Attributed Resources (Workflow Participant Types) C = Cost Sut = set-up time St = Stability Skills overlap arbitrarily! 11, 12, 15 12, 13, 16, 19 17, 18, 19 C: 400 € Sut: 200 St: 95% C: 150 € Sut: 200 St: 90% C: 250 € Sut: 200 St: 95% Overlap Overlap

10. Partially Ordered Plan (POP) Each activity has to be executet! 0 12 13 15 16 17 18 19 100 11 Start End Activity Precedence relation

11. Flexible Processes 0 12 13 15 16 17 18 19 100 11 0 12 13 15 17 18 19 100 11 20 0 12 13 15 16 17 19 100 11 21 22

12. Continuous Supply There is always work to do at each station! Object are passed only in one direction!

14. Problem Specification (Given) maximal cycle time 0 12 13 15 16 17 18 19 100 11 0 12 13 15 17 18 19 100 11 20 0 12 13 15 16 17 19 100 11 21 22

15. Problem Specification (2) Organisation? Infrastructure? Block i A j

16. Problem Specification (2) Organisation? Infrastructure? Process logic? Block i A j

17. Partitioning (Example) Partitioning guarantees a directed data flow! 0 12 13 15 16 17 18 19 100 11 0 12 13 15 16 17 18 19 100 11

18. Partitioning 0 12 13 15 16 17 18 19 100 11 11, 12, 15 12, 13, 16, 19 17, 18, 19 1. Rule: 15 16: 15 in 16 in different blocks

19. Partitioning (2) 11, 12, 15 12, 13, 16, 19 17, 18, 19 0 12 13 15 16 17 18 19 100 11 2. Rule: 12 15: 12 in and 15 in the same block

20. Partitioning (3) 0 12 13 15 16 17 18 19 100 11 3. Rule: 16 19: 16 in 19 in and a) different blocks b) the same block 11, 12, 15 12, 13, 16, 19 17, 18, 19

22. Model: Data Structures Number blocks: Set of all costs: General loss: Maximum cycle time : Set of all activities: Set of all dates: Set of percentage:

23. Model: Resource Projections :

24. Model: Data Structures Costs: Participant type tuple: Number participant types tuple:

25. Model: POP A POP is a directed, acyclic and compound graph: We denote the set of all POPs by : Nodes Edges Projections :

26. Model: POP Union: Let Then

27. Model: Partition Partition of A u in: Let and And ...next slide

28. Model: Partition(2) Otherwise: Properties of a directed flow:

29. Model: Partition(3) General Assignment:

30. Total Running Time per Block set-up time running times transit time total running time / block t A1 U A2 U A3 Su1 Su2

31. Infrastructure Number of resources in a block S i (where WPT W i ) Number resources Rtb

33. Cycle Time number resources cycle time

35. Heuristic (Design) number blocks Number of blocks is increasing resources Choose the block with the least resource type assignment possibilities. Assign the cheapest resource type. activities Choose the longest activity. Assign it to the block with the cheapest resource.

36. Goal-oriented Heuristic 2. Order/Select: choose longest activity 1. Filter: nondetermined activity 3. Value: assign to the block with the cheapest WPT. 400 € 150 € 250 €

37. Problem: Goal-oriented Heuristic Bad! 400 € 150 € 250 €

38. Problem: Goal-oriented Heuristic Better! 400 € 150 € 250 €

48. Scheduling (Bridge) 2 4 5 6 7 3 1 8 9 11 13 14 15 16 12 17 19 20 21 22 18 23 25 26 27 28 24 10 41 29 31 32 33 34 30 36 38 39 40 35 37 42 43 44 excavator Pile driver carpentry concrete mixer worker bricklaying crane caterpillar