https://doi.org/10.1140/epjqt/s40507-026-00494-y
Review
Quantum algorithms for scheduling problems: a survey
1
Institute of Systems Engineering for Future Mobility, German Aerospace Center (DLR), Escherweg 2, 26129, Oldenburg, Lower Saxony, Germany
2
Institute of Quantum Technologies, German Aerospace Center (DLR), Wilhelm-Runge-Strasse 10, 89081, Ulm, Baden-Württemberg, Germany
a
This email address is being protected from spambots. You need JavaScript enabled to view it.
Received:
1
July
2025
Accepted:
5
March
2026
Published online:
19
March
2026
Abstract
Quantum algorithms have the potential to solve combinatorial optimization problems faster than classical algorithms. A particular example for combinatorial optimization problems are scheduling problems. This work provides summarizes quantum or quantum-inspired algorithms for scheduling problems, providing an overview of 20 years of research. We categorize the approaches by problem type and algorithm type. A condensation of the reviewed literature to the main ideas and details about the considered problem size, solvers and evaluation metrics enables a quick comparison with and placement into the current state of research for future works. We further critically assess the comparability of the reviewed literature and present crucial metrics for future comparison.
Key words: Scheduling Problems / Quadratic unconstrained binary optimization / Mixed-integer linear programming / Quantum genetic algorithms
© The Author(s) 2026
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
