A Systematic Numerical Reduction Algorithm for Scheduling Graphs Imitating Symbolic Reduction

This article is about the Forfex algorithm, which speeds up the enumeration of all possible solutions of a scheduling graph problem modeled in a Resource-Action-Constraint model, imitating symbolic reduction, by eliminating unnecessary action sequences. The article introduces the theoretical background, the scope of the research, the Forfex algorithm and the results.