We address a novel staff allocation problem that arises in the organization of collaborators among multiple school sites and educational levels. The problem emerges from a real case study in a public school in Calabria, Italy, where staff members must be distributed across kindergartens, primary, and secondary schools under constraints of availability, competencies, and fairness. To tackle this problem, we develop an optimization model and investigate a solution approach based on quantum annealing. Our computational experiments on real-world data show that quantum annealing is capable of producing balanced assignments in short runtimes. These results provide evidence of the practical applicability of quantum optimization methods in educational scheduling and, more broadly, in complex resource allocation tasks.
We address a novel staff allocation problem that arises in the organization of collaborators among multiple school sites and educational levels. The problem emerges from a real case study in a public school in Calabria, Italy, where staff members must be distributed across kindergartens, primary, and secondary schools under constraints of availability, competencies, and fairness. To tackle this problem, we develop an optimization model and investigate a solution approach based on quantum annealing. Our computational experiments on real-world data show that quantum annealing is capable of producing balanced assignments in short runtimes. These results provide evidence of the practical applicability of quantum optimization methods in educational scheduling and, more broadly, in complex resource allocation tasks.
Real-time healthcare workforce scheduling represents a critical optimization challenge with direct implications for patient care quality and operational efficiency. This article introduces a quantum computing approach to dynamic hospital staff rescheduling that addresses the complex constraints of medical workforce allocation when facing unexpected absences. By formulating the problem as a quadratic unconstrained binary optimization (QUBO) model suitable for quantum processing, demonstrate how quantum annealing and gate-based quantum algorithms can rapidly identify optimal staff substitutions while balancing factors such as specialist qualifications, shift duration, fatigue management, and geographical proximity. The simulation results indicate that quantum-accelerated scheduling can significantly reduce the average time to fill critical absences compared to classical heuristic methods while maintaining high adherence to staffing quality metrics. This has substantial potential to mitigate the downstream clinical impacts of staffing disruptions, particularly in high-acuity hospital departments where timely specialist presence is essential for patient outcomes.
Quantum annealing is a promising heuristic method to solve combinatorial optimization problems, and efforts to quantify performance on real-world problems provide insights into how this approach may be best used in practice. We investigate the empirical performance of quantum annealing to solve the Nurse Scheduling Problem (NSP) with hard constraints using the D-Wave 2000Q quantum annealing device. NSP seeks the optimal assignment for a set of nurses to shifts under an accompanying set of constraints on schedule and personnel. After reducing NSP to a novel Ising-type Hamiltonian, we evaluate the solution quality obtained from the D-Wave 2000Q against the constraint requirements as well as the diversity of solutions. For the test problems explored here, our results indicate that quantum annealing recovers satisfying solutions for NSP and suggests the heuristic method is potentially achievable for practical use. Moreover, we observe that solution quality can be greatly improved through the use of reverse annealing, in which it is possible to refine returned results by using the annealing process a second time. We compare the performance of NSP using both forward and reverse annealing methods and describe how this approach might be used in practice.
This article explores the use of QUBO as a practical and educational framework for solving complex optimization problems. QUBO models are widely applicable across fields such as scheduling, routing, and resource allocation, and are compatible with classical, hybrid, and quantum solvers. We discuss the core principles behind QUBO, its connection to physical systems like the Ising model, and its growing relevance in research and education. To demonstrate the practical side, we apply QUBO to a real-world-inspired Multi-agent Route Planning problem, where the goal is to maximize the network coverage while minimizing the total overlap of vehicle-routes. This use-case helps illustrate how QUBO formulations can model trade-offs, encode constraints, and scale to larger problem sizes. In addition, we evaluate midsized instances of the problem on D-Wave Systems’ Advantage2 quantum annealer. The study aims to bridge theoretical optimization with hands-on experimentation, making it suitable for both teaching and applied research.
Talent scheduling is a complicated task that arises from the intricate interplay of human resources, project dynamics, and organizational goals. The inherent complexities are magnified when managing tasks that involve a diverse array of factors, including skills, project timelines, and resource limitations. This paper introduces a novel approach employing quantum annealing to address the complex challenge of talent scheduling. Quantum annealing, an emerging field known for its innate optimization capabilities, offers a compelling framework for addressing this multifaceted challenge. We present a comprehensive exploration of our proposed quantum annealing-based method, comparing its efficacy against the traditional dynamic programming approach and various meta-heuristic algorithms. Our experimental results reveal that the proposed quantum annealing-based approach achieves optimality equivalent to the dynamic programming approach but with significantly reduced runtime. Additionally, we examine the outcomes when compared to other meta-heuristic approaches, shedding light on the comparative strengths and limitations. Furthermore, we investigate the impact of varying the number of samples and sweeps within our quantum annealing-based approach, providing insights into the sensitivity of our method to these parameters.
This paper introduces a novel quantum-enhanced constraint satisfaction (QCS) algorithm, Quantum-Enhanced Constraint Satisfaction (QCS), designed to address the limitations of traditional constraint satisfaction methods when confronted with complex scheduling challenges. We propose a quantum annealing approach to efficiently explore the search space of possible schedules, potentially leading to optimal solutions for resource allocation problems. The core mechanism centers around utilizing quantum annealing to navigate the vast solution space, enabling faster and more effective scheduling outcomes. The paper details the algorithm's design, the rationale behind its quantum-enhanced nature, and preliminary experimental results demonstrating its potential for improved scheduling performance. We conclude with a discussion of future research directions, including exploration of scalability and optimization of the quantum annealing process.
Airline companies struggle every day trying to schedule crew, flights and aircraft.Tail Assignment is the problem of allocating individual aircraft to a set of flights, while ensuring multiple constraints and aiming to minimise an objective function, such as operational costs.Given the enormous amount of possibilities and constraints involved, this problem has been a study case for the last decade.Many solutions have emerged using classical computing, but with limitations regarding performance.Quantum Annealing (QA) is a heuristic technique for finding global minimum energy levels over an energy landscape using quantum mechanics.Due to its characteristics, it has been proved to have a clear advantage in solving some complex optimisation problems, being a promising technique to apply in multiple fields.In this study, Tail Assignment Problem was set as a Quadratic Unconstrained Binary Optimisation (QUBO) model, using two different techniques, and was solved using a classical and two hybrid solvers.Tests were run based on extractions from real-world data, analysing the performance of the implementation in terms of time, scalability and quality (i.e., the lowest operational costs) of the obtained solutions.We concluded that using a library for modelling the problem as well as considering individual flights rather than pre-aggregating them in strings can be a bottleneck when it comes to its scalability.Furthermore, we found out that there was a higher probability of obtaining better solutions for this problem using one of the hybrid solvers when compared with the classical heuristic algorithms such as Simulated Annealing (SA).These findings can serve as foundations for further studies.