On applicability of symbolic techniques to larger scheduling problems

It has been generally assumed that recently introduced symbolic techniques are applicable only to small scheduling problems. This report demonstrates that applicability of these techniques can be extended to larger dataflow graphs by: (i) using Zero-Suppressed BDDs, (ii) applying a set of interior constraints that reduce the size of intermediate solutions, (iii) implicit application of complex constraints, and (iv) formulation of set-based heuristics that preserve whole sets of partial solutions exhibiting desirable properties. Both heuristic and exact methods are discussed using standard benchmarks and are compared to the previously published work