Application of Quantum Approximate Optimization Algorithm on a Single Machine Scheduling Problem
THE TENTH INTERNATIONAL CONFERENCE ON COMPUTATIONAL MATHEMATICS AND ENGINEERING SCIENCES (CMES- 2026), İstanbul, Türkiye, 24 - 26 Nisan 2026, cilt.1, ss.109-117, (Tam Metin Bildiri)
- Yayın Türü: Bildiri / Tam Metin Bildiri
- Cilt numarası: 1
- Basıldığı Şehir: İstanbul
- Basıldığı Ülke: Türkiye
- Sayfa Sayıları: ss.109-117
- 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. Many exact and heuristic solution methods are available in the literature for scheduling problems. 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, rendering classical methods impractical. Modern research explores using Quantum Computing to solve scheduling problems for faster solutions. This paper presents a quantum approximate optimization algorithm (QAOA) approach for the single-machine problem of minimizing weighted tardiness and shows that QAOA achieves optimal results.