arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 2205.04844quant-ph
收藏

工作流调度问题的QUBO建模求解

Solving workflow scheduling problems with QUBO modeling

A. I. Pakhomchik, S. Yudin, M. R. Perelshtein, A. Alekseyenko, S. Yarkoni

摘要:

在本文中,我们研究的工作流调度问题,一个已知的NP难调度问题。我们从工业用例中获得问题实例,并与几种量子,经典和混合量子经典算法进行比较。我们开发了一种新的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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑