Quantum Speed-ups for Single-machine Scheduling Problems - Laboratoire d'Informatique Fondamentale et Appliquée de Tours Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

Quantum Speed-ups for Single-machine Scheduling Problems

Résumé

Grover search is currently one of the main approaches to obtain quantum speed-ups for combinatorial optimization problems. The combination of Quantum Minimum Finding (obtained from Grover search) with dynamic programming has proved particularly efficient to improve the worst-case complexity of several NP-hard optimization problems. Specifically, for these problems, the classical dynamic programming complexity (ignoring the polynomial factors) in O*(cn) can be reduced by a bounded-error hybrid quantumclassical algorithm to O*(cn quant) for c quant < c. In this paper, we extend the resulting hybrid dynamic programming algorithm to three examples of single-machine scheduling problems: minimizing the total weighted completion time with deadlines, minimizing the total weighted completion time with precedence constraints, and minimizing the total weighted tardiness. The extension relies on the inclusion of a pseudo-polynomial term in the state space of the dynamic programming as well as an additive term in the recurrence
Fichier principal
Vignette du fichier
GECCO23.pdf (530.12 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
licence : CC BY - Paternité

Dates et versions

hal-04095026 , version 1 (11-05-2023)

Licence

Paternité

Identifiants

Citer

Camille Grange, Eric Bourreau, Michael Poss, Vincent t'Kindt. Quantum Speed-ups for Single-machine Scheduling Problems. GECCO 2023 - Genetic and Evolutionary Computation Conference, Jul 2023, Lisbonne, Portugal. ⟨10.1145/3583133.3596415⟩. ⟨hal-04095026⟩
249 Consultations
74 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More