Conformance checking and performance improvement in scheduled processes: A queueing-network perspective
作者：
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.
摘要
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.
论文关键词：Scheduled processes,Conformance checking,Process improvement,Queueing networks,Process mining,Scheduling,Statistical inference
论文评审过程：Available online 28 January 2016, Version of Record 10 September 2016.
论文官网地址：https://doi.org/10.1016/j.is.2016.01.002
