The efficiency of semiconductor frontend manufacturing highly depends on the optimization of resource allocation. In academic works, scheduling methods, i.e., based on Constraint Programming (CP) or Mixed Integer Programming (MIP), are popular tools for solving this optimization problem. As the problem is NP-hard, complete optimization methods do not scale to the problem size and complexity required for realistic fabwide scheduling. Therefore, the problem is often decomposed and solved locally.