Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Conference on Cybernetics (CYBCONF)

Quantum Computing-Based Real-Time Optimization Method for Large-Scale Single-Machine Scheduling

Lixiang Zhang, Qing Gao, Yu Pan, Jinhu Lü

Published Apr 1, 2026• 0 citations
Publisher
DOI
10.1109/cybconf69298.2026.11670285

Related papers

A Hybrid Solution Approach for Large-scale Batch Scheduling with Quantum Computing

Akshay Ajagekar, Fengqi You

Computer-aided chemical engineering/Computer aided chemical engineering•Jan 1, 2021•1 citation

Performance Analysis of Classical and Quantum Machine Learning Models for Electricity Load Scheduling

Prof. Pooja Kadam, Sachin Kadam, Upasana Pandey +1 more

When talking about rising demand for electricity, shifting to renewable energy sources, and prioritizing grid stability, one thing that is crucial is optimizing the scheduling of electricity load based on the demand. There are various classical machine learning (ML) and meta-heuristic optimization methods (Particle Swarm Optimization, Genetic Algorithms, Differential Evolution, Simulated Annealing) used to forecast load, and then schedule accordingly to minimize cost, reduce the peak load of system, and improve the overall efficiency. However, these methods struggle in handling large-scale combinatorial complexity and multiple constrained systems in real time. This paper presents a comparative study of classical ML-based optimization techniques and introduces a novel quantum-machine-learning approach using the Quantum Approximate Optimization Algorithm (QAOA) for electricity load scheduling. Initially, a survey was conducted and several classical techniques for optimization and forecasting were evaluated on realistic demand data. The paper highlights their strengths and drawbacks in terms of solution quality, computational time, and scalability. Then, the paper proposes and apply QAOA to the same scheduling problem, formulating load scheduling as a quadratic unconstrained binary optimization (QUBO) model suitable for quantum optimization. We assess the performance of QAOA against classical methods under identical constraints. Thus, Simulated Annealing produces a normalized cost of 0.00029 (after 37 seconds) whereas the cost found by Differential Evolution is 0.1314 and by the Genetic Algorithm 0.4379. This tends to confirm the validity of classical heuristics for smaller problems [16]. Our results show that while classical methods perform well for small to medium scale problems, the QAOA approach offers competitive or superior performance in terms of optimization quality and scalability for larger, more complex instances, with potential reductions in computation time under certain conditions. We conclude by discussing the practical challenges of implementing QAOA (e.g. noise, parameter tuning) and suggest directions for future research to advance quantum-assisted optimization in electricity scheduling.

International Journal of Artificial Intelligence and Machine Learning•Jan 1, 2026•0 citations

Optimizing Distributed Systems With Quantum Computing

Manish Patil, Shraddha Sanjay Mhetre

As systems become more complex and large-scale, there is a need for more effective scheduling algorithms to maximize resource usage and minimize job completion times. The older methods of scheduling like First-Come-First-Serve (FCFS) and Round Robin (RR), although easier to compute, tend to perform poorly in dynamic scenarios because they cannot manage intricate constraints and multi-objective optimization efficiently. As traditional methods approach their limit of performance, quantum computing presents a potentially fruitful avenue for conquering combinatorial challenges based on its ability to examine many states at once. This work proposes a quantum-aided scheduling framework that employs Quadratic Unconstrained Binary Optimization (QUBO) formulations and quantum solvers for the purpose of improving job scheduling in distributed environments. The original contribution is the marrying of quantum optimization (with IBM Qiskit's QAOA and D-Wave's hybrid solvers) with traditional distributed computing frameworks such as Apache Spark. Google Cluster Workload Traces are employed to mimic real-world situations, and jobs are described by CPU, memory requirements, and arrival times. Once the scheduling problem has been formulated into a QUBO model, quantum algorithms produce the optimized job-to-machine assignments. The outcomes are compared against baseline classical schedulers on performance metrics including make span, throughput, and resource utilization. The experiment demonstrates that quantum-assisted scheduling significantly improves makespan and enhances resource utilization, particularly under high workloads. It also provides evidence of the feasibility of integrating quantum solvers with existing big data infrastructures.

International Journal of Advances in Signal and Image Sciences•Sep 25, 2025•0 citations

Addressing Machine Unavailability in Job Shop Scheduling: A Quantum Computing Approach

Riad Aggoune, Samuel Deleplanque

Lecture notes in computer science•Jan 1, 2024•2 citations

User Scheduling and Clustering for Distributed Antenna Network Using Quantum Computing

Keishi Hanakago, Ryo Takahashi, Takahiro Ohyama +1 more

In this study, an overloaded large-scale distributed antenna network is considered, for which the number of active users is larger than that of antennas distributed in a base station coverage area (called a cell). To avoid overload, users in each cell are divided into multiple user groups, and, to reduce the computational complexity required for multi-user multiple-input and multiple-output (MU-MIMO), users in each user group are grouped into multiple user clusters so that cluster-wise distributed MU-MIMO can be performed in parallel in each user group. However, as the network size increases, conventional computational methods may not be able to solve combinatorial optimization problems, such as user scheduling and user clustering, which are required for performing cluster-wise distributed MU-MIMO in a finite amount of time. In this study, we apply quantum computing to solve the combinatorial optimization problems of user scheduling and clustering for an overloaded distributed antenna network and propose a quantum computing-based user scheduling and clustering method. The results of computer simulations indicate that as the technology of quantum computers and their related algorithms evolves in the future, the proposed method can realize large-scale dense wireless systems and realize real-time optimization with a short optimization execution cycle.

IEICE Transactions on Communications•Jul 23, 2023•1 citation

Optimizing two-machine scheduling in flexible manufacturing systems using autonomous AI and quantum computing

Wojciech Bożejko, Sergii Trotskyi, Mariusz Uchroński +1 more

Neurocomputing•Nov 7, 2025•7 citations
When talking about rising demand for electricity, shifting to renewable energy sources, and prioritizing grid stability, one thing that is crucial is optimizing the scheduling of electricity load based on the demand. There are various classical machine learning (ML) and meta-heuristic optimization methods (Particle Swarm Optimization, Genetic Algorithms, Differential Evolution, Simulated Annealing) used to forecast load, and then schedule accordingly to minimize cost, reduce the peak load of system, and improve the overall efficiency. However, these methods struggle in handling large-scale combinatorial complexity and multiple constrained systems in real time. This paper presents a comparative study of classical ML-based optimization techniques and introduces a novel quantum-machine-learning approach using the Quantum Approximate Optimization Algorithm (QAOA) for electricity load scheduling. Initially, a survey was conducted and several classical techniques for optimization and forecasting were evaluated on realistic demand data. The paper highlights their strengths and drawbacks in terms of solution quality, computational time, and scalability. Then, the paper proposes and apply QAOA to the same scheduling problem, formulating load scheduling as a quadratic unconstrained binary optimization (QUBO) model suitable for quantum optimization. We assess the performance of QAOA against classical methods under identical constraints. Thus, Simulated Annealing produces a normalized cost of 0.00029 (after 37 seconds) whereas the cost found by Differential Evolution is 0.1314 and by the Genetic Algorithm 0.4379. This tends to confirm the validity of classical heuristics for smaller problems [16]. Our results show that while classical methods perform well for small to medium scale problems, the QAOA approach offers competitive or superior performance in terms of optimization quality and scalability for larger, more complex instances, with potential reductions in computation time under certain conditions. We conclude by discussing the practical challenges of implementing QAOA (e.g. noise, parameter tuning) and suggest directions for future research to advance quantum-assisted optimization in electricity scheduling.
As systems become more complex and large-scale, there is a need for more effective scheduling algorithms to maximize resource usage and minimize job completion times. The older methods of scheduling like First-Come-First-Serve (FCFS) and Round Robin (RR), although easier to compute, tend to perform poorly in dynamic scenarios because they cannot manage intricate constraints and multi-objective optimization efficiently. As traditional methods approach their limit of performance, quantum computing presents a potentially fruitful avenue for conquering combinatorial challenges based on its ability to examine many states at once. This work proposes a quantum-aided scheduling framework that employs Quadratic Unconstrained Binary Optimization (QUBO) formulations and quantum solvers for the purpose of improving job scheduling in distributed environments. The original contribution is the marrying of quantum optimization (with IBM Qiskit's QAOA and D-Wave's hybrid solvers) with traditional distributed computing frameworks such as Apache Spark. Google Cluster Workload Traces are employed to mimic real-world situations, and jobs are described by CPU, memory requirements, and arrival times. Once the scheduling problem has been formulated into a QUBO model, quantum algorithms produce the optimized job-to-machine assignments. The outcomes are compared against baseline classical schedulers on performance metrics including make span, throughput, and resource utilization. The experiment demonstrates that quantum-assisted scheduling significantly improves makespan and enhances resource utilization, particularly under high workloads. It also provides evidence of the feasibility of integrating quantum solvers with existing big data infrastructures.
In this study, an overloaded large-scale distributed antenna network is considered, for which the number of active users is larger than that of antennas distributed in a base station coverage area (called a cell). To avoid overload, users in each cell are divided into multiple user groups, and, to reduce the computational complexity required for multi-user multiple-input and multiple-output (MU-MIMO), users in each user group are grouped into multiple user clusters so that cluster-wise distributed MU-MIMO can be performed in parallel in each user group. However, as the network size increases, conventional computational methods may not be able to solve combinatorial optimization problems, such as user scheduling and user clustering, which are required for performing cluster-wise distributed MU-MIMO in a finite amount of time. In this study, we apply quantum computing to solve the combinatorial optimization problems of user scheduling and clustering for an overloaded distributed antenna network and propose a quantum computing-based user scheduling and clustering method. The results of computer simulations indicate that as the technology of quantum computers and their related algorithms evolves in the future, the proposed method can realize large-scale dense wireless systems and realize real-time optimization with a short optimization execution cycle.