Hybrid Quantum Approximate Algorithms for Solving Flow Shop Scheduling Problem

• Published in: IEEE International Symposium on Computational Intelligence and Informatics pp. 117 - 122
• Main Authors: Bozejko, Wojciech, Idzikowski, Radoslaw, Jagielski, Dariusz, Klempous, Ryszard, Trotskyi, Sergii, Tykierko, Mateusz, Uchronski, Mariusz, Wodecki, Mieczyslaw
• Format: Conference Proceeding
• Language: English
• Published: IEEE 19.11.2024
• Subjects: Computational intelligence; Computers; Informatics; Job shop scheduling; Logistics; Optimization; Processor scheduling; Production; Quantum mechanics; Qubit
• ISSN: 2471-9269
• DOI: 10.1109/CINTI63048.2024.10830818

There is currently a large gap between the theoretical advantages of quantum computing and the practical use of quantum computers. This is due to the small number of qubits currently available. Rapid technological progress allows us to assume that in the near future, it will be possible to solve problems that are currently a challenge for algorithms running on classical computers. Using the example of an NP-hard flow problem, we present the application of the Qiskit optimization package performed on an IBM quantum computer. This problem is well-studied in classical computing, important for theoretical and practical reasons. The use of quantum optimization will undoubtedly affect the more efficient use of many resources in management, production, logistics, and medicine (duty plans, classification problems, etc.).