Pith. sign in

REVIEW

Solving workflow scheduling problems with QUBO modeling

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2205.04844 v1 pith:E7B62HSQ submitted 2022-05-10 quant-ph

A. I. Pakhomchik , S. Yudin , M. R. Perelshtein , A. Alekseyenko , S. Yarkoni This is my paper · ORCID
classification quant-ph
keywords problemschedulingqubocomplexityderiveproblemsworkflowalgorithms
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Pith tools