Hybrid Quantum-Classical Optimization of the Resource Scheduling Problem

Abstract

Resource scheduling is critical in many industries, especially in power systems. The Unit Commitment problem determines the on/off status and output levels of generators under many constraints. Traditional exact methods, such as mathematical programming methods or dynamic programming, remain the backbone of UC solution techniques, but they often rely on linear approximations or exhaustive search, leading to high computational burdens as system size grows. Metaheuristic approaches, such as genetic algorithms, particle swarm optimization, and other evolutionary methods, have been explored to mitigate this complexity; however, they typically lack optimality guarantees, exhibit sensitivity to initial conditions, and can become prohibitively time-consuming for large-scale systems. In this paper, we introduce a quantum-classical hybrid algorithm for UC and, by extension, other resource scheduling problems, that leverages Benders decomposition to decouple binary commitment decisions from continuous economic dispatch. The binary master problem is formulated as a quadratic unconstrained binary optimization model and solved on a quantum annealer. The continuous subproblem, which minimizes generation costs, with Lagrangian cuts feeding back to the master until convergence. We evaluate our hybrid framework on systems scaled from 10 to 1,000 generation units. Compared against a classical mixed-integer nonlinear programming baseline, the hybrid algorithm achieves a consistently lower computation-time growth rate and maintains an absolute optimality gap below 1.63%. These results demonstrate that integrating quantum annealing within a hybrid quantum-classical Benders decomposition loop can significantly accelerate large-scale resource scheduling without sacrificing solution quality, pointing toward a viable path for addressing the escalating complexity of modern power grids.