Overprocessing waste occurs in a business process when effort is spent in a way that does not add value to the customer nor to the business. Previous studies have identified a recurrent overprocessing pattern in business processes with so-called “knockout checks”, meaning activities that classify a case into “accepted” or “rejected”, such that if the case is accepted it proceeds forward, while if rejected, it is cancelled and all work performed in the case is considered unnecessary. Thus, when a knockout check rejects a case, the effort spent in other (previous) checks becomes overprocessing waste. Traditional process redesign methods propose to order knockout checks according to their mean effort and rejection rate. This paper presents a more fine-grained approach where knockout checks are ordered at runtime based on predictive machine learning models. Experiments on two real-life processes show that this predictive approach outperforms traditional methods while incurring minimal runtime overhead.
Minimizing Overprocessing Waste in Business Processes via Predictive Activity Ordering / Verenich, Ilya; Dumas, Marlon; La Rosa, Marcello; Maggi, Fabrizio Maria; Di Francescomarino, Chiara. - 9694:(2016), pp. 186-202. (Intervento presentato al convegno 28th International Conference on Advanced Information Systems Engineering (CAiSE 2016) tenutosi a Ljubljana, Slovenia nel June 13- 17, 2016) [10.1007/978-3-319-39696-5_12].
Minimizing Overprocessing Waste in Business Processes via Predictive Activity Ordering
Di Francescomarino, Chiara
2016-01-01
Abstract
Overprocessing waste occurs in a business process when effort is spent in a way that does not add value to the customer nor to the business. Previous studies have identified a recurrent overprocessing pattern in business processes with so-called “knockout checks”, meaning activities that classify a case into “accepted” or “rejected”, such that if the case is accepted it proceeds forward, while if rejected, it is cancelled and all work performed in the case is considered unnecessary. Thus, when a knockout check rejects a case, the effort spent in other (previous) checks becomes overprocessing waste. Traditional process redesign methods propose to order knockout checks according to their mean effort and rejection rate. This paper presents a more fine-grained approach where knockout checks are ordered at runtime based on predictive machine learning models. Experiments on two real-life processes show that this predictive approach outperforms traditional methods while incurring minimal runtime overhead.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione