Skip to main content
Search

University of Mannheim

2 related articles

Subscribe to updates
  1. arXiv

    Across 14 event logs, remaining-time error and uncertainty rise with delay, and uncertainty features lift average delay-detection recall from 0.21 to 0.61

    Analyzing the intrinsic difficulty of delay detection across 14 public event logs, the study finds that remaining times are strongly right-skewed, that existing LSTM models capture the mode of the distribution but perform poorly on high-delay cases, and that prediction error and prediction-interval width both grow with true remaining time (positive in 10 of 14 logs); it then evaluates imbalanced regression approaches (SMOGN resampling, CSW, BMSE, EAL, SERA) with only limited benefit, and instead feeds uncertainty features from a survival model (prediction standard deviation, 80% and 90% prediction-interval widths, tail mass, and temporal context) into a CatBoost classifier for binary delay detection, raising average recall from 0.21 to 0.61 at the q=0.

  2. arXiv

    NSGA-II optimization of resource-level handover policies cuts cost by 37% and waiting time by 58% on average across synthetic and real event logs

    The work introduces the first approach for multi-objective optimization of resource-level handover policies in business processes: taking a Multi-Agent System (MAS) simulation model as input, it uses NSGA-II to search for Pareto-optimal person-specific handover policies, and across five synthetic Loan Application variants and seven real event logs it reduces cost by an average of 37% and waiting time by 58% relative to the as-is process, outperforming availability, random, lowest-cost (LC), and shortest-processing-time (SPT) heuristic baselines in most settings.

You’re all caught up