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

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, Oskar Siemieniuk, Jarosław Wielgus

Published Jan 1, 2026• 1 citation
Publisher
DOI
10.1007/978-3-032-27927-9_5

Related papers

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

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 +1 more

Future Generation Computer Systems•Feb 19, 2024•22 citations

On Quantum Computing Formulations for the Total Weighted Tardiness and Total Weighted Earliness Optimization

Mikołaj Bożejko, Igor Janiak, Hubert Siewiera +2 more

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

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

Progress on exploring practical applications of quantum annealing and D-Wave One

Sergio Boixo, Federico M. Spedalieri

Bulletin of the American Physical Society•Feb 29, 2012•0 citations

A Quantum Optimization Algorithm for Single Machine Total Weighted Tardiness Minimization

Youhao Steve Wang, Julian Cheng

A single machine total weighted tardiness minimization (TWTM) problem in operational planning is considered. The problem is formulated as an NP-hard constrained combinatorial problem, which has no known deterministic polynomial complexity solution using classical computing. Based on efficient Grover's quantum search and Trugenberger's quantum optimization algorithms, a novel efficient quantum optimization algorithm is proposed to solve the NP-hard single machine TWTM problem, which makes the desired solution satisfying the searching constraints and showing the minimal TWT value be measured with the highest probability.

arXiv:2209.13712•Sep 27, 2022•0 citations
A single machine total weighted tardiness minimization (TWTM) problem in operational planning is considered. The problem is formulated as an NP-hard constrained combinatorial problem, which has no known deterministic polynomial complexity solution using classical computing. Based on efficient Grover's quantum search and Trugenberger's quantum optimization algorithms, a novel efficient quantum optimization algorithm is proposed to solve the NP-hard single machine TWTM problem, which makes the desired solution satisfying the searching constraints and showing the minimal TWT value be measured with the highest probability.