Conformance checking and performance improvement in scheduled processes: A queueing-network perspective

Arik Senderovich, Matthias Weidlich, Liron Yedidsion, Avigdor Gal, Avishai Mandelbaum, Sarah Kadish, Craig A. Bunnell

Abstract: Highlights•We provide a broad extension to the notions of conceptual, operational and continuous conformance checking techniques.•We present novel theoretical results in terms of scheduling algorithms for Fork/Join networks that re-sequence arriving cases. We prove that these scheduling algorithms are guaranteed to never perform worse than the baseline approach.•We test the new techniques for process improvement on real-world data, and show that the proposed algorithms yield a 20%-40% improvement in median flow time and tardiness.