Riad Aggoune
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Riad Aggoune has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Samuel Deleplanque
JUNIA, Centrale Lille, CNRS, Univ. Lille, Valenciennes, France
5 shared publications - Luis Fernando Pérez Armas
Catholic University of Lille - IÉSEG School of Management, Lille Campus
2 shared publications - Mohamed Laib
IDYST, Faculty of Geosciences and Environment, University of Lausanne, 1015 Lausanne, Switzerland
1 shared publication Pierre Hubsch
ArcelorMittal Global R &D
1 shared publicationRafael Crespo
ArcelorMittal Global R &D
1 shared publication- Stefan Creemers
Catholic University of Lille - IESEG School of Management; KU Leuven
1 shared publication
Latest Publications
- 4 May 2026
- Published by Springer Nature in Journal of Heuristics
- Vol. 32 (2)
Quantum annealing heuristics for the job shop scheduling problem with availability constraints
- 4 May 2026
- Published by Springer Nature in Journal of Heuristics
- Vol. 32 (2)
Quantum annealing heuristics for the job shop scheduling problem with availability constraints
- 11 December 2025
- Published by The Royal Society in Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
- Vol. 383 (2310)
A hybrid column generation-based heuristic for solving the parallel machine scheduling problem with sequence-dependent set-up times
This study explores the application of a hybrid quantum-classical algorithm for solving the parallel machine scheduling problem (PMSP) with sequence-dependent set-up times, a pivotal scheduling problem that has applications in multiple industries. Using a column generation-based approach, we propose a heuristic that combines a classical linear relaxation for the master problem with quantum annealing (QA) for solving the pricing subproblem (PSP). Whereas the PSP generates columns (i.e. a sequence of jobs that are assigned to a machine), the master problem selects which columns to use in order to minimize the makespan of the schedule. To generate columns, the PSP solves a travelling salesman problem (TSP) that is formulated as a quadratic unconstrained binary optimization (QUBO) problem. The big advantage thereof is that subtours can be eliminated by use of quadratic terms in the objective function. In addition, our approach also leverages the quantum annealer’s capability to generate many high-quality solutions (i.e. columns) in a very short time. To assess the performance of our hybrid column generation-based heuristic, we perform a computational experiment. The results of this experiment demonstrate the synergy of hybrid methods for tackling complex decision-making problems, achieving competitive high-quality solutions and computational advantages when compared with classical solution methods. This article is part of the theme issue ‘Quantum theory and topology in models of decision making (Part 2)’.
- 11 December 2025
- Published by The Royal Society in Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
- Vol. 383 (2310)
A hybrid column generation-based heuristic for solving the parallel machine scheduling problem with sequence-dependent set-up times
This study explores the application of a hybrid quantum-classical algorithm for solving the parallel machine scheduling problem (PMSP) with sequence-dependent set-up times, a pivotal scheduling problem that has applications in multiple industries. Using a column generation-based approach, we propose a heuristic that combines a classical linear relaxation for the master problem with quantum annealing (QA) for solving the pricing subproblem (PSP). Whereas the PSP generates columns (i.e. a sequence of jobs that are assigned to a machine), the master problem selects which columns to use in order to minimize the makespan of the schedule. To generate columns, the PSP solves a travelling salesman problem (TSP) that is formulated as a quadratic unconstrained binary optimization (QUBO) problem. The big advantage thereof is that subtours can be eliminated by use of quadratic terms in the objective function. In addition, our approach also leverages the quantum annealer’s capability to generate many high-quality solutions (i.e. columns) in a very short time. To assess the performance of our hybrid column generation-based heuristic, we perform a computational experiment. The results of this experiment demonstrate the synergy of hybrid methods for tackling complex decision-making problems, achieving competitive high-quality solutions and computational advantages when compared with classical solution methods. This article is part of the theme issue ‘Quantum theory and topology in models of decision making (Part 2)’.
- 17 June 2024
- Published by Springer Nature
- p. 234-245
Addressing Machine Unavailability in Job Shop Scheduling: A Quantum Computing Approach
- 17 June 2024
- Published by Springer Nature
- p. 234-245
Addressing Machine Unavailability in Job Shop Scheduling: A Quantum Computing Approach
- 29 June 2023
- Published by Springer Nature
- p. 421-428
A Quantum Annealing Solution to the Job Shop Scheduling Problem
- 29 June 2023
- Published by Springer Nature
- p. 421-428
A Quantum Annealing Solution to the Job Shop Scheduling Problem
- Open Access
Solving the Job Shop Scheduling Problem: QUBO model and Quantum Annealing
Quantum optimization which is the use of quantum computers and algorithms for solving complex optimization problems, is one of the topics in quantum computing with the highest potential. Two types of approaches are generally used to solve combinatorial optimization problems with quantum computers: exact methods such as the Grover’s search algorithm, and meta-heuristics such as the Quantum Annealing and the Quantum Approximate Optimization Algorithm (QAOA). Exact methods and variational methods like QAOA make use of universal gate-based quantum computers, such as the ones developed by the IBM company.Quantum annealing is designed for analogic quantum computers developed by D-Wave. Solving a combinatorial optimization problem with heuristics generally requires a transformation of the problem to a format suitable for the quantum computer. While some existing frameworks can cope with Constrained Quadratic Models (CQM), Quadratic Unconstrained Binary Optimization (QUBO) is the best option to map an optimization problem to a quantum computer or simulator. We consider in this paper the job shop scheduling problem.
Open AccessSolving the Job Shop Scheduling Problem: QUBO model and Quantum Annealing
Quantum optimization which is the use of quantum computers and algorithms for solving complex optimization problems, is one of the topics in quantum computing with the highest potential. Two types of approaches are generally used to solve combinatorial optimization problems with quantum computers: exact methods such as the Grover’s search algorithm, and meta-heuristics such as the Quantum Annealing and the Quantum Approximate Optimization Algorithm (QAOA). Exact methods and variational methods like QAOA make use of universal gate-based quantum computers, such as the ones developed by the IBM company.Quantum annealing is designed for analogic quantum computers developed by D-Wave. Solving a combinatorial optimization problem with heuristics generally requires a transformation of the problem to a format suitable for the quantum computer. While some existing frameworks can cope with Constrained Quadratic Models (CQM), Quadratic Unconstrained Binary Optimization (QUBO) is the best option to map an optimization problem to a quantum computer or simulator. We consider in this paper the job shop scheduling problem.
- 23 July 2022
- Published by Springer Nature
- p. 63-76
Steel Quality Monitoring Using Data-Driven Approaches: ArcelorMittal Case Study
- 23 July 2022
- Published by Springer Nature
- p. 63-76
Steel Quality Monitoring Using Data-Driven Approaches: ArcelorMittal Case Study