Application of Quantum Algorithms on Scheduling Problems
3rd International Conference on Engineering, Natural Sciences, and Technological Developments (ICENSTED 2026), Erzurum, Türkiye, 3 - 06 Temmuz 2026, cilt.1, ss.869-875, (Tam Metin Bildiri)
- Yayın Türü: Bildiri / Tam Metin Bildiri
- Cilt numarası: 1
- Basıldığı Şehir: Erzurum
- Basıldığı Ülke: Türkiye
- Sayfa Sayıları: ss.869-875
- Açık Arşiv Koleksiyonu: AVESİS Açık Erişim Koleksiyonu
- Bursa Uludağ Üniversitesi Adresli: Evet
Özet
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.