Application of Quantum Algorithms on Scheduling Problems
3rd International Conference on Engineering, Natural Sciences, and Technological Developments (ICENSTED 2026), Erzurum, Turkey, 3 - 06 July 2026, vol.1, pp.869-875, (Full Text)
- Publication Type: Conference Paper / Full Text
- Volume: 1
- City: Erzurum
- Country: Turkey
- Page Numbers: pp.869-875
- Open Archive Collection: AVESIS Open Access Collection
- Bursa Uludag University Affiliated: Yes
Abstract
Scheduling is a prevalent research area in combinatorial optimization and operations research, where exact and heuristic methods are available in literature. However, most scheduling problems are NP-hard, and as the problem size increases with system constraints and an increasing number of jobs and machines, the computation time also increases exponentially. This makes exact methods, and even heuristics, impractical for real-life scheduling problems. Modern research explores using Quantum Computing to solve scheduling problems for faster solutions, and this paper presents a brief review of single-machine and shop-type scheduling problems solved by Quantum methods.