论文标题
通过QUBO建模解决工作流程计划问题
Solving workflow scheduling problems with QUBO modeling
论文作者
论文摘要
在本文中，我们调查了工作流程调度问题，这是已知的NP-HARD类调度问题。我们从工业用例中得出问题实例，并与几种量子，经典和混合量子古典算法进行比较。我们开发了一种新颖的QUBO来表示我们的调度问题，并展示Qubo复杂性如何取决于输入问题。我们得出了一种针对此特定应用的分解方法，以减轻这种复杂性并证明该方法的有效性。
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.
