A Quantum Optimization Algorithm for Single Machine Total Weighted Tardiness Minimization
Data Structures and Algorithms
2022-09-29 v1
Abstract
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.
Cite
@article{arxiv.2209.13712,
title = {A Quantum Optimization Algorithm for Single Machine Total Weighted Tardiness Minimization},
author = {Youhao Steve Wang and Julian Cheng},
journal= {arXiv preprint arXiv:2209.13712},
year = {2022}
}