🤖 AI Summary
Quantum annealing hybrid solvers (e.g., D-Wave’s Constrained Quadratic Model solver) face severe capacity limitations, preventing direct optimization of large-scale workflow scheduling problems (WSPs).
Method: This paper proposes the Series-Parallel Workflow Decomposition (SPWD) heuristic—a novel structured graph decomposition technique integrated into the quantum hybrid solving framework. SPWD automatically partitions ultra-large WSP instances into solver-constrained subproblems while preserving structural dependencies and coordinating their schedules to ensure global feasibility.
Contribution/Results: Evaluated on the WfCommons benchmark suite, SPWD successfully solves real-world workflow instances several times larger than the native solver’s capacity, maintaining solution quality and demonstrating strong scalability and engineering practicality. The core contribution lies in overcoming hardware-imposed size constraints and establishing the first structured, workflow-aware decomposition paradigm tailored for quantum hybrid optimization.
📝 Abstract
We introduce the Series-Parallel Workflow Decomposition (SP-WD) heuristic algorithm for the Workflow Scheduling Problem (WSP) decomposition. We demonstrate that the SPWD algorithm facilitates the scheduling of large WSP instances with the hybrid D-Wave Constrained Quadratic Model solver, enabling the scheduling of instances that would otherwise exceed its capacity limitations. We also describe the accompanying execution environment used to obtain the results of the experiments with real-life workflow instances available in the WfCommons standardization initiative repository.