Aim of this epic is to cover loose ends identified in first results of multithreaded solving scalability tests.

• Tests should use score calculation count termination instead of step count limit (currently score calculation count termination is broken for multithreaded search).
• Conference Scheduling should be added to have a non-chained domain with rich constraints.
• heap usage should be investigated, as it shows much more used memory for small dataset than for large dataset, which is in contrary to expectation.