In this paper we investigate the workflow scheduling problem, a known NP-hard class of scheduling problems. We derive problem instances from an industrial use case and compare against several quantum, classical, and hybrid quantum-classical algorithms. We develop a novel QUBO to represent our scheduling problem and show how the QUBO complexity depends on the input problem. We derive and present a decomposition method for this specific application to mitigate this complexity and demonstrate the effectiveness of the approach.
@article{arxiv.2205.04844,
title = {Solving workflow scheduling problems with QUBO modeling},
author = {A. I. Pakhomchik and S. Yudin and M. R. Perelshtein and A. Alekseyenko and S. Yarkoni},
journal= {arXiv preprint arXiv:2205.04844},
year = {2022}
}