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

Future Generation Computer Systems

Quantum annealing-driven branch and bound for the single machine total weighted number of tardy jobs scheduling problem

Wojciech Bożejko, Jarosław Pempera, Mariusz Uchroński, Mieczysław Wodecki

Published Feb 19, 2024• 22 citations
Publisher
DOI
10.1016/j.future.2024.02.016

Related papers

An Exact Quantum Annealing-Driven Branch and Bound Algorithm for Maximizing the Total Weighted Number of on-Time Jobs on a Single Machine

Wojciech Bożejko, Jarosław Pempera, Mariusz Uchroński +1 more

Lecture notes in networks and systems•Jan 1, 2023•2 citations

Distributed Quantum Annealing on D-Wave for the Single Machine Total Weighted Tardiness Scheduling Problem

Wojciech Bożejko, Jarosław Pempera, Mariusz Uchroński +1 more

Lecture notes in computer science•Jan 1, 2022•7 citations

On Quantum Annealing Chain Strength Related Parameters Control in D-Wave for the Single Machine Total Weighted Tardiness Problem

Wojciech Bożejko, Filip Górajewski, Yana Baloshenko +2 more

Lecture notes in networks and systems•Jan 1, 2026•1 citation

A Quantum Annealing Solution to the Job Shop Scheduling Problem

Riad Aggoune, Samuel Deleplanque

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

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

Riad Aggoune, Samuel Deleplanque

•Mar 4, 2024•0 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