Solving the Flow-Shop Scheduling problem using Grover's Algorithm - Université de technologie de Troyes Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

Solving the Flow-Shop Scheduling problem using Grover's Algorithm

Résumé

We study the flow-shop scheduling problem under the makespan minimization. The Grover's algorithm is adapted and implemented to solve the problem. We introduce an encoding for the data and variables and propose a feasibility and optimization oracles. The first oracle checks the feasibility of the solution while the second oracle allows compute the objective function of the solution, when valid. The proposed algorithm is illustrated using an example of the two machine flow-shop.
Fichier non déposé

Dates et versions

hal-04447024 , version 1 (08-02-2024)

Identifiants

Citer

Malak Saiem, Taha Arbaoui, Faicel Hnaien. Solving the Flow-Shop Scheduling problem using Grover's Algorithm. GECCO '23 Companion: Companion Conference on Genetic and Evolutionary Computation, Sep 2023, Lisbon Portugal, Portugal. pp.2250-2253, ⟨10.1145/3583133.3596378⟩. ⟨hal-04447024⟩
8 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More