A Quantum Annealing Solution to the Job Shop Scheduling Problem

Auteurs

Aggoune R., Deleplanque S.

Référence

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 14104 LNCS, pp. 421-428, 2023

Description

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.

Lien

doi:10.1007/978-3-031-37105-9_28