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.