Discovering queues from event logs with varying levels of information
ConferentiebijdrageSenderovich, A., Leemans, S,J.J., Harel, S., Gal, A., Mandelbaum, A. & van der Aalst, W.M.P. (2016). Discovering queues from event logs with varying levels of information. In M. Reichert & H.A. Reijers (Eds.), Business Process Management Workshops (pp. 154-166). (Lecture Notes in Business Information Processing, No. 256). Dordrecht: Springer. In Scopus Cited 1 times.
Detecting and measuring resource queues is central to business process optimization. Queue mining techniques allow for the identification of bottlenecks and other process inefficiencies, based on event data. This work focuses on the discovery of resource queues. In particular, we investigate the impact of available information in an event log on the ability to accurately discover queue lengths, i.e. the number of cases waiting for an activity. Full queueing information, i.e. timestamps of enqueueing and exiting the queue, makes queue discovery trivial. However, often we see only the completions of activities. Therefore, we focus our analysis on logs with partial information, such as missing enqueueing times or missing both enqueueing and service start times. The proposed discovery algorithms handle concurrency and make use of statistical methods for discovering queues under this uncertainty. We evaluate the techniques using real-life event logs. A thorough analysis of the empirical results provides insights into the influence of information levels in the log on the accuracy of the measurements.