A Quantum Annealing Solution to the Job Shop Scheduling Problem - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

A Quantum Annealing Solution to the Job Shop Scheduling Problem

Résumé

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.
Fichier non déposé

Dates et versions

hal-04172854 , version 1 (28-07-2023)

Identifiants

Citer

Riad Aggoune, Samuel Deleplanque. A Quantum Annealing Solution to the Job Shop Scheduling Problem. 23rd International Conference on Computational Science and Its Applications, ICCSA 2023 Workshops, Jul 2023, Athens, Greece. pp.421-428, ⟨10.1007/978-3-031-37105-9_28⟩. ⟨hal-04172854⟩
25 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More