Solving variants of the job shop scheduling problem through conflict-directed search

We introduce a simple technique for disjunctive machine scheduling problems and show that this method can match or even outperform state-of-the-art algorithms on a number of problem types. Our approach [...]