A faster checker of the energetic reasoning for the cumulative scheduling problem
提出一个O(n×α(n)×log n)的能量推理检查器，比现有最优的O(n log² n)更快，通过减少有用区间数量实现，对工业调度优化求解器有应用价值。
This paper constitutes a step forward in resource-constrained scheduling theory. We introduce an O(n×α(n)×logn) checker for energetic reasoning (ER), where α(n) is Ackermann's inverse function. Until now, after more than 20 years of research, the best technique, recently obtained by Ouellet and Quimper, was in O(nlog2n). We identify mathematical properties that allow the number of useful intervals to be reduced. We also discuss the interest of integrating this checker into industrial solvers developed for addressing optimisation problems.