Conformance checking and performance improvement in scheduled processes: A queueing-network perspective
详细信息 查看全文
- 作者：Arik Senderovicha ; sariks@tx.technion.ac.il" class="auth_mail" title="E-mail the corresponding author ; Matthias Weidlichb ; matthias.weidlich@hu-berlin.de" class="auth_mail" title="E-mail the corresponding author ; Liron Yedidsiona ; lirony@ie.technion.ac.il" class="auth_mail" title="E-mail the corresponding author ; Avigdor Gala ; avigal@ie.technion.ac.il" class="auth_mail" title="E-mail the corresponding author ; Avishai Mandelbauma ; avim@ie.technion.ac.il" class="auth_mail" title="E-mail the corresponding author ; Sarah Kadishc ; sarah_kadish@dfci.harvard.edu" class="auth_mail" title="E-mail the corresponding author ; Craig A. Bunnellc ; craig_bunnell@dfci.harvard.edu" class="auth_mail" title="E-mail the corresponding author
- 关键词：Scheduled processes ; Conformance checking ; Process improvement ; Queueing networks ; Process mining ; Scheduling ; Statistical inference
- 刊名：Information Systems
- 出版年：2016
- 出版时间：December 2016
- 年：2016
- 卷：62
- 期：Complete
- 页码：185-206
- 全文大小：1456 K
文摘
- •
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.