People regularly ask how OptalCP does on the big benchmarks. The largest job shop instances around are the ones published by Giacomo Da Col and Erich Teppan: randomly generated by the same generator as the classic Taillard set, in sizes from 100 jobs on 100 machines up to 1,000 jobs on 1,000 machines — one million operations in a single scheduling problem. We recently ran OptalCP on them: all ten 1000×100 instances (100,000 operations each) are now solved to proven optimality, and on the 1000×1000 instances we obtained the best known results.