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

Lecture notes in networks and systems

Hybrid Quantum Annealing Approach for Huge Neighborhoods Searching in Application to Task Scheduling

Wojciech Bożejko, Sergii Trotskyi, Mariusz Uchroński, Mieczysław Wodecki

Published Jan 1, 2026• 0 citations
Publisher
DOI
10.1007/978-3-032-14163-7_9

Related papers

Hybrid Quantum Annealing Heuristic Method for Solving Job Shop Scheduling Problem

Krzysztof Kurowski, Jan Węglarz, Marek Subocz +2 more

Lecture notes in computer science•Jan 1, 2020•39 citations

Adaptive Hybrid Quantum Annealing with Dynamic Scheduling and Chain Repair for Combinatorial Optimization Problems

Asmaa Hussein Alwan, Nuha Sami Mohsin, Abdullah Hasan Ali

Ingénierie des systèmes d information•Jul 31, 2026•0 citations

Optimizing quantum annealing schedules with Monte Carlo tree search enhanced with neural networks

Yuqin Chen, Yu Chen, Chee‐Kong Lee +2 more

arXiv:2004.02836•Nature Machine Intelligence•Mar 14, 2022•50 citations

Solving Job-Shop Scheduling Problems with QUBO-Based Specialized Hardware

Jiachen Zhang, Giovanni Lo Bianco, J. Christopher Beck

The emergence of specialized hardware, such as quantum computers and Digital/CMOS annealers, and the slowing of performance growth of general-purpose hardware raises an important question for our community: how can the high-performance, specialized solvers be used for planning and scheduling problems? In this work, we focus on the job-shop scheduling problem (JSP) and Quadratic Unconstrained Binary Optimization (QUBO) models, the mathematical formulation shared by a number of novel hardware platforms. We study two direct QUBO models of JSP and propose a novel large neighborhood search (LNS) approach, that hybridizes a QUBO model with constraint programming (CP). Empirical results show that our LNS approach significantly outperforms classical CP-based LNS methods and a mixed integer programming model, while being competitive with CP for large problem instances. This work is the first approach that we are aware of that can solve non-trivial JSPs using QUBO hardware, albeit as part of a hybrid algorithm.

Proceedings of the International Conference on Automated Planning and Scheduling•Jun 13, 2022•17 citations

Quantum Annealing to Solve the Unrelated Parallel Machine Scheduling Problem

Francisco José Orts, Antonio Manuel Puertas, Ester Martín Garzón +1 more

Lecture notes in computer science•Jan 1, 2023•3 citations

Hybrid quantum annealing for large-scale exam scheduling: Validation in real-world educational scenarios

Ziyu Zhou, Qing Chen, Chaojie Zhang +2 more

Applied Soft Computing•Aug 13, 2025•2 citations
The emergence of specialized hardware, such as quantum computers and Digital/CMOS annealers, and the slowing of performance growth of general-purpose hardware raises an important question for our community: how can the high-performance, specialized solvers be used for planning and scheduling problems? In this work, we focus on the job-shop scheduling problem (JSP) and Quadratic Unconstrained Binary Optimization (QUBO) models, the mathematical formulation shared by a number of novel hardware platforms. We study two direct QUBO models of JSP and propose a novel large neighborhood search (LNS) approach, that hybridizes a QUBO model with constraint programming (CP). Empirical results show that our LNS approach significantly outperforms classical CP-based LNS methods and a mixed integer programming model, while being competitive with CP for large problem instances. This work is the first approach that we are aware of that can solve non-trivial JSPs using QUBO hardware, albeit as part of a hybrid algorithm.