English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this paper we investigate the workflow scheduling problem, a known NP-hardclass of scheduling problems. We derive problem instances from an industrialuse case and compare against several quantum, classical, and hybridquantum-classical algorithms. We develop a novel QUBO to represent ourscheduling problem and show how the QUBO complexity depends on the inputproblem. We derive and present a decomposition method for this specificapplication to mitigate this complexity and demonstrate the effectiveness ofthe approach.

Solving workflow scheduling problems with QUBO modeling