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

International Conference on Artificial Intelligence, Computer, Data Sciences and Applications (ACDSA)

A Quantum Annealing-Based Approach for Solving Talent Scheduling

Kundjanasith Thonglek, Pongsakorn Sihapitak, Chonho Lee

Published Feb 1, 2024• 1 citation
Publisher

Abstract

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.

DOI
10.1109/acdsa59508.2024.10467799

Related papers

Solving the resource constrained project scheduling problem with quantum annealing

Luis Fernando Pérez Armas, Stefan Creemers, Samuel Deleplanque

Quantum annealing emerges as a promising approach for tackling complex scheduling problems such as the resource-constrained project scheduling problem (RCPSP). This study represents the first application of quantum annealing to solve the RCPSP, analyzing 12 well-known mixed integer linear programming (MILP) formulations and converting the most qubit-efficient one into a quadratic unconstrained binary optimization (QUBO) model. We then solve this model using the D-wave advantage 6.3 quantum annealer, comparing its performance against classical computer solvers. Our results indicate significant potential, particularly for small to medium-sized instances. Further, we introduce time-to-target and Atos Q-score metrics to evaluate the effectiveness of quantum annealing and reverse quantum annealing. The paper also explores advanced quantum optimization techniques, such as customized anneal schedules, enhancing our understanding and application of quantum computing in operations research.

Scientific Reports•Jul 22, 2024•40 citations

Quantum-classical hybrid algorithm using quantum annealing for multi-objective job shop scheduling

Kenta Sawamura, Kensuke Araki, Naoki Maruyama +2 more

Efficient production planning is essential in modern manufacturing to improve performance indicators such as lead time and to reduce reliance on human intuition. While mathematical optimization approaches, formulated as job shop scheduling problems, have been applied to automate this process, solving large-scale production planning problems remains computationally demanding. Moreover, many practical scenarios involve conflicting objectives, making traditional scalarization techniques ineffective in finding diverse and useful Pareto-optimal solutions. To address these challenges, we developed a quantum-classical hybrid algorithm that decomposes the problem into two subproblems: resource allocation and task scheduling. Resource allocation is formulated as a quadratic unconstrained binary optimization problem and solved using annealing-based methods that efficiently explore complex solutions. Task scheduling is modeled as a mixed-integer linear programming problem and solved using conventional solvers to satisfy detailed scheduling constraints. We validated the proposed method using benchmark instances based on foundry production scenarios. Experimental results demonstrate that our hybrid approach achieves superior solution quality and computational efficiency compared to traditional monolithic methods. This work offers a promising direction for high-speed, multi-objective scheduling in industrial applications.

quant-pharXiv:2511.03257•Journal of the Physical Society of Japan•Nov 6, 2025•7 citations

Quantum-Enhanced Constraint Satisfaction (QCS) for Scheduling

Jincheng Zhang

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.

•Sep 7, 2026•0 citations

Quantum Annealing Algorithm Optimization and Application

Jincheng Zhang

Quantum annealing (QA) is a promising quantum computing paradigm for solving optimization problems. However, the performance of QA is often limited by issues such as slow convergence rates and sensitivity to parameter settings. This paper presents a novel optimization method designed to address these limitations. The approach introduces refined parameters and an adaptive strategy to enhance the algorithm's convergence speed and solution accuracy. We explore the application of this optimized QA method to complex problems, demonstrating its potential for improved performance. The core of the optimization lies in modifying the annealing schedule and incorporating a dynamic adjustment of the magnetic field strength, denoted as $H(t)$, where $t$ represents time. The objective function to be minimized is typically represented as $E[s]$, where $s$ is the state vector of the quantum annealer. We introduce a variance reduction technique, denoted as $\sigma(t)$, which is dynamically adjusted based on the error estimates of the current state. The overall optimization process can be summarized as: $\min_{s} E[s] \quad \text{subject to} \quad \frac{dS}{dt} = - \beta(t) E[s] - \gamma(t) H(t)s$ where $\beta(t)$ is the annealing rate and $\gamma(t)$ is the magnetic field strength. The adaptive strategy involves updating $\beta(t)$ and $\gamma(t)$ based on the error in the current solution, aiming to reduce the variance $\sigma(t)$ and improve the convergence. The theoretical analysis suggests that this approach can significantly reduce the computational cost and improve the solution quality compared to traditional QA methods. Furthermore, we investigate the impact of different parameter settings on the algorithm's performance, highlighting the importance of careful tuning for optimal results. The results demonstrate a notable improvement in solution quality and convergence speed across various benchmark problems.

•Sep 3, 2026•0 citations

Workforce Task Execution Scheduling Using Gate-Based Quantum Computers

Mitsuharu Takeori, Noriaki Shimada, Dimitris Alevras +4 more

Recent advancements in quantum computing technology have heralded a new era of computational capabilities, outpacing classical simulations in solving complex problems. This remarkable progress has sparked a burgeoning interest in quantum algorithms across various sectors, with optimization emerging as a particularly vibrant field of study. A focal point of this field is the development and refinement of optimization algorithms that are suitable for current and emerging capability of quantum computers. These advancements are crucial as they offer practical ways to apply quantum computing to real-world challenges. Among these applications, personnel and task execution scheduling is a compelling use case for quantum computing as applied to solve complex optimization problems critical to business and industrial operations. In this paper, we explore the utilization of quantum computers to address this class of optimization problems. Employing a range of advanced techniques, including a novel method that improves efficiency, our method demonstrates the capability of quantum computing to provide effective solutions for intricate optimization problems. We particularly focus on the application of IBM's 127 -qubit quantum devices to manage scheduling tasks in workforce management, involving 500 to 874 binary decision variables and over 1000 constraints. This exploration serves not only as a proof of concept for the practical applications of quantum computing but also as a testament to its evolving role in solving business-critical optimization challenges.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•1 citation

QCE'24 Tutorial: Quantum Annealing -- Emerging Exploration for Database Optimization

Nayak, Nitin, Manuel Schönberger, Valter Uotila +4 more

Quantum annealing is a meta-heuristic approach tailored to solve combinatorial optimization problems with quantum annealers. In this tutorial, we provide a fundamental and comprehensive introduction to quantum annealing and modern data management systems and show quantum annealing's potential benefits and applications in the realm of database optimization. We demonstrate how to apply quantum annealing for selected database optimization problems, which are critical challenges in many data management platforms. The demonstrations include solving join order optimization problems in relational databases, optimizing sophisticated transaction scheduling, and allocating virtual machines within cloud-based architectures with respect to sustainability metrics. On the one hand, the demonstrations show how to apply quantum annealing on key problems of database management systems (join order selection, transaction scheduling), and on the other hand, they show how quantum annealing can be integrated as a part of larger and dynamic optimization pipelines (virtual machine allocation). The goal of our tutorial is to provide a centralized and condensed source regarding theories and applications of quantum annealing technology for database researchers, practitioners, and everyone who wants to understand how to potentially optimize data management with quantum computing in practice. Besides, we identify the advantages, limitations, and potentials of quantum computing for future database and data management research.

arXiv:2411.04638•Nov 7, 2024•6 citations
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.
Quantum annealing emerges as a promising approach for tackling complex scheduling problems such as the resource-constrained project scheduling problem (RCPSP). This study represents the first application of quantum annealing to solve the RCPSP, analyzing 12 well-known mixed integer linear programming (MILP) formulations and converting the most qubit-efficient one into a quadratic unconstrained binary optimization (QUBO) model. We then solve this model using the D-wave advantage 6.3 quantum annealer, comparing its performance against classical computer solvers. Our results indicate significant potential, particularly for small to medium-sized instances. Further, we introduce time-to-target and Atos Q-score metrics to evaluate the effectiveness of quantum annealing and reverse quantum annealing. The paper also explores advanced quantum optimization techniques, such as customized anneal schedules, enhancing our understanding and application of quantum computing in operations research.
Efficient production planning is essential in modern manufacturing to improve performance indicators such as lead time and to reduce reliance on human intuition. While mathematical optimization approaches, formulated as job shop scheduling problems, have been applied to automate this process, solving large-scale production planning problems remains computationally demanding. Moreover, many practical scenarios involve conflicting objectives, making traditional scalarization techniques ineffective in finding diverse and useful Pareto-optimal solutions. To address these challenges, we developed a quantum-classical hybrid algorithm that decomposes the problem into two subproblems: resource allocation and task scheduling. Resource allocation is formulated as a quadratic unconstrained binary optimization problem and solved using annealing-based methods that efficiently explore complex solutions. Task scheduling is modeled as a mixed-integer linear programming problem and solved using conventional solvers to satisfy detailed scheduling constraints. We validated the proposed method using benchmark instances based on foundry production scenarios. Experimental results demonstrate that our hybrid approach achieves superior solution quality and computational efficiency compared to traditional monolithic methods. This work offers a promising direction for high-speed, multi-objective scheduling in industrial applications.
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.
Quantum annealing (QA) is a promising quantum computing paradigm for solving optimization problems. However, the performance of QA is often limited by issues such as slow convergence rates and sensitivity to parameter settings. This paper presents a novel optimization method designed to address these limitations. The approach introduces refined parameters and an adaptive strategy to enhance the algorithm's convergence speed and solution accuracy. We explore the application of this optimized QA method to complex problems, demonstrating its potential for improved performance. The core of the optimization lies in modifying the annealing schedule and incorporating a dynamic adjustment of the magnetic field strength, denoted as H(t)H(t)H(t), where ttt represents time. The objective function to be minimized is typically represented as E[s]E[s]E[s], where sss is the state vector of the quantum annealer. We introduce a variance reduction technique, denoted as σ(t)\sigma(t)σ(t), which is dynamically adjusted based on the error estimates of the current state. The overall optimization process can be summarized as: min⁡sE[s]subject todSdt=−β(t)E[s]−γ(t)H(t)s\min_{s} E[s] \quad \text{subject to} \quad \frac{dS}{dt} = - \beta(t) E[s] - \gamma(t) H(t)smins​E[s]subject todtdS​=−β(t)E[s]−γ(t)H(t)s where β(t)\beta(t)β(t) is the annealing rate and γ(t)\gamma(t)γ(t) is the magnetic field strength. The adaptive strategy involves updating β(t)\beta(t)β(t) and γ(t)\gamma(t)γ(t) based on the error in the current solution, aiming to reduce the variance σ(t)\sigma(t)σ(t) and improve the convergence. The theoretical analysis suggests that this approach can significantly reduce the computational cost and improve the solution quality compared to traditional QA methods. Furthermore, we investigate the impact of different parameter settings on the algorithm's performance, highlighting the importance of careful tuning for optimal results. The results demonstrate a notable improvement in solution quality and convergence speed across various benchmark problems.
Recent advancements in quantum computing technology have heralded a new era of computational capabilities, outpacing classical simulations in solving complex problems. This remarkable progress has sparked a burgeoning interest in quantum algorithms across various sectors, with optimization emerging as a particularly vibrant field of study. A focal point of this field is the development and refinement of optimization algorithms that are suitable for current and emerging capability of quantum computers. These advancements are crucial as they offer practical ways to apply quantum computing to real-world challenges. Among these applications, personnel and task execution scheduling is a compelling use case for quantum computing as applied to solve complex optimization problems critical to business and industrial operations. In this paper, we explore the utilization of quantum computers to address this class of optimization problems. Employing a range of advanced techniques, including a novel method that improves efficiency, our method demonstrates the capability of quantum computing to provide effective solutions for intricate optimization problems. We particularly focus on the application of IBM's 127 -qubit quantum devices to manage scheduling tasks in workforce management, involving 500 to 874 binary decision variables and over 1000 constraints. This exploration serves not only as a proof of concept for the practical applications of quantum computing but also as a testament to its evolving role in solving business-critical optimization challenges.
Quantum annealing is a meta-heuristic approach tailored to solve combinatorial optimization problems with quantum annealers. In this tutorial, we provide a fundamental and comprehensive introduction to quantum annealing and modern data management systems and show quantum annealing's potential benefits and applications in the realm of database optimization. We demonstrate how to apply quantum annealing for selected database optimization problems, which are critical challenges in many data management platforms. The demonstrations include solving join order optimization problems in relational databases, optimizing sophisticated transaction scheduling, and allocating virtual machines within cloud-based architectures with respect to sustainability metrics. On the one hand, the demonstrations show how to apply quantum annealing on key problems of database management systems (join order selection, transaction scheduling), and on the other hand, they show how quantum annealing can be integrated as a part of larger and dynamic optimization pipelines (virtual machine allocation). The goal of our tutorial is to provide a centralized and condensed source regarding theories and applications of quantum annealing technology for database researchers, practitioners, and everyone who wants to understand how to potentially optimize data management with quantum computing in practice. Besides, we identify the advantages, limitations, and potentials of quantum computing for future database and data management research.