A Quantum Annealing Solution to the Job Shop Scheduling Problem.

We consider in this paper the job shop scheduling problem. We first present a mathematical formulation of the problem, namely a disjunctive model. Then, we show how the model can be reformulated as a Quadratic Unconstrained Binary Optimization (QUBO) problem, that can be solved by an analog quantum computer.