Quantum Annealing Implementation of Job-Shop Scheduling [article]

Davide Venturelli, Dominic J.J. Marchand, Galo Rojo
2016 arXiv   pre-print
A quantum annealing solver for the renowned job-shop scheduling problem (JSP) is presented in detail. After formulating the problem as a time-indexed quadratic unconstrained binary optimization problem, several pre-processing and graph embedding strategies are employed to compile optimally parametrized families of the JSP for scheduling instances of up to six jobs and six machines on the D-Wave Systems Vesuvius processor. Problem simplifications and partitioning algorithms, including variable
more » ... uning and running strategies that consider tailored binary searches, are discussed and the results from the processor are compared against state-of-the-art global-optimum solvers.
arXiv:1506.08479v2 fatcat:2gm3eys7qfa2ld7ljedsafzmca