Modeling & Impl Busi Processes
Consider the following event log:
1A B G C D H I2A B C E F G H I3A C B G E F H J4A B C G D H J5A C B E F H G 6A C D H B G I7A B G C E F J8A C E F B G H J
Determine the dependency graph (3 points)
Determine the log relations (follows, causality, parallelism, no-relation) and the footprint matrix (3 points)
Show step by step how the alpha algorithm works on this log, and draw the resulting process model (Tip: you can use process mining software to check your work) (6 points)
The company is particularly interested in answers to the following questions:
What does the process model look like?
Which resources generate the highest activation rate of applications?
What are the throughput times per part of the process, in particular the difference between the time spent in the company’s systems waiting for processing by a user and the time spent waiting on input from the applicant as this is currently unclear,
What is the influence on the frequency of incompleteness to the final outcome. The hypothesis here is that if applicants are confronted with more requests for completion, they are more likely to not accept the final offer,
How many customers ask for more than one offer (where it matters if these offers are asked for in a single conversation or in multiple conversations)?
How does the conversion compare between applicants for whom a single offer is made and applicants for whom multiple offers are made?