A SAT algorithm allows a simple mode feasibility check and a scheduling step using a single activity list instead of two separate lists as normally done in literature.
In a SAT algorithm it is easy to implement learning (Section 3.3.2) which can be used over different mode combination searches.