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

A Simple Approach for Complexity Reduction in Job Shop Scheduling Using Quantum Computers

Eike Permin, Sean Borgard, Lina Castillo, Nicolas Pyschny

Published Jan 1, 2022• 3 citations
Publisher
DOI
10.2139/ssrn.4259131

Related papers

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

A Quantum Annealing Solution to the Job Shop Scheduling Problem

Riad Aggoune, Samuel Deleplanque

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

Job Shop-Scheduling Based on Quantum Annealing

Chun-Yi Huang, Chung‐Nan Lee, Ming-Te Tsai

International Conference on Intelligent Computing and Its Emerging Applications (ICEA)•Dec 14, 2023•0 citations

A Quantum Annealing Solution to the Job Shop Scheduling Problem with Availability Constraints

Riad Aggoune, Samuel Deleplanque

•Mar 4, 2024•0 citations

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•37 citations

Quantum annealing heuristics for the job shop scheduling problem with availability constraints

Samuel Deleplanque, Luis Fernando Pérez Armas, Riad Aggoune

Journal of Heuristics•May 4, 2026•1 citation