Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Quantum-Assisted Optimization for Ergonomics-Aware Human–Robot Task Allocation in Human-Centric Manufacturing - A QUBO Formulation, Quantum-Annealing and QAOA Benchmark Against Classical Baselines

Peter Nimbe, Joshua Akowuje Weyori¹, Bernard Kyiewu, Kingsford Donkor

Published Nov 13, 2026• 0 citations
PDF (CC BY)Publisher

Abstract

Abstract Industry 5.0 shifts the focus of manufacturing automation toward human well-being, not just efficiency or output. This means task-allocation systems now have to juggle production targets, ergonomic safety, and what the workforce can realistically handle. Here, we introduce what we call the Ergonomics-Aware Human–Robot Task Allocation (EA-HRTA) problem. Picture it as a complex assignment challenge: for every task, we have to consider execution cost, whether the person or robot has the right skills, the workload each can take on, and the total ergonomic strain humans can safely handle. We turn this challenge into a Quadratic Unconstrained Binary Optimization (QUBO) model, so it runs on both quantum-annealing machines and gate-model quantum computers. We lay out three key contributions: first, we develop a penalty-based QUBO model and show exactly how to set penalty weights so it actually works. Second, we roll out a complete system where the very same QUBO gets sent both to a D-Wave-style simulated-annealing sampler and to our own lightweight, dependency-free QAOA statevector simulator. Finally, we’ve built and open-sourced a benchmarking suite that lets you see how quantum solutions perform next to a quick, greedy heuristic and a full-scale CBC integer programming baseline.. Across 60 runs spanning problem sizes from 9 to 240 binary variables, quantum annealing maintains a 100% constraint-feasibility rate at every scale tested, matching classical baselines closely on small instances (within 2% of the exact optimum at N = 9) but exhibiting a solution-quality gap that widens to roughly 140% at N = 240 under fixed penalty weights and a fixed annealing schedule. QAOA achieves competitive cost values only at the smallest instance tested (N = 9) and loses feasibility entirely by N = 16, consistent with known near-term gate-model scalability limits. We report a warm-start ablation seeding the annealer with the greedy solution, which does not yield a consistent improvement, and use this negative result to motivate an adaptive-penalty and problem-decomposition research direction. Rather than claiming a present-day quantum advantage, this paper contributes a reusable ergonomics-aware QUBO formulation, a transparent and reproducible benchmark methodology for the human-centric manufacturing community, and an honest empirical map of where current quantum optimization methods stand relative to classical practice at realistic shop-floor problem sizes.

DOI
10.21203/rs.3.rs-11057389/v1

Related papers

QUANTUM OPTIMIZATION FOR HUMAN-COLLABORATIVE MULTI-AMR SCHEDULING IN SMART FACTORIES: A REVIEW AND INDUSTRY 5.0 PERSPECTIVE

K.Sai Bhargav, P.Venkata Sai Jagadeesh, M. Koushik Varma +1 more

Autonomous Mobile Robots (AMRs) are increasingly deployed in smart factories and intralogistics systems, yet dynamic fleet scheduling remains challenging because of growing task complexity, multi-objective requirements, and human–robot interaction. This review examines the evolution of AMR scheduling from Mixed-Integer Linear Programming (MILP), heuristics, metaheuristics, and Reinforcement Learning (RL) toward emerging quantum and hybrid quantum–classical optimization. Particular attention is given to Quadratic Unconstrained Binary Optimization (QUBO), the Quantum Approximate Optimization Algorithm (QAOA), and quantum annealing as potential approaches for representing coupled task allocation, routing, energy management, and human-safety requirements. The industrial implications of quantum-enhanced scheduling are critically discussed in terms of operational coordination, resource efficiency, human-centric collaboration, and scalability. Sector-specific opportunities and current research maturity are further assessed from an Industry 5.0 perspective. The review identifies hybrid quantum–classical architectures, dynamic QUBO formulations, Digital Twin integration, and human-aware scheduling as key research directions for advancing scalable and adaptive multi-AMR fleet coordination.

Iterative International Publishers eBooks•Sep 1, 2026•0 citations

Towards quantum-ready optimization: A QUBO model for task assignment to autonomous mobile robots

Ole Christian Prüfer, Jens Heger

Autonomous Mobile Robots (AMRs) play an increasingly important role in flexible and reconfigurable production systems. Assigning heterogeneous tasks to multiple AMRs constitutes a combinatorial optimization problem that becomes computationally intractable as system complexity grows. This paper presents a Quadratic Unconstrained Binary Optimization (QUBO) model for AMR task assignment, integrating scheduling and resource allocation within a Hamiltonian formulation. The model is parameterized and evaluated using both exact and heuristic solvers to analyze scalability and validity across benchmark scenarios. Results demonstrate the trade-off between computational effort and solution optimality, confirming the feasibility of the QUBO representation for this problem class. The formulated model creates a basis for future implementation on quantum hardware for optimization using Quantum Annealing (QA) or the Quantum Approximate Optimization Algorithm (QAOA), thereby bridging the gap between classical optimization methods and new quantum computing paradigms.

Procedia CIRP•Jan 1, 2026•0 citations

Quantum Annealing for Resource Allocation in Next-Generation Wireless Communication Networks: A QUBO Modeling Guide

Nguyen Xuan Tung, Le Tung Giang, Mai Dinh Cong +4 more

Quantum annealing (QA) offers a physics-inspired approach for such subproblems by mapping them onto an Ising Hamiltonian, which is algebraically equivalent to a Quadratic Unconstrained Binary Optimization (QUBO) model executable on quantum annealers or hybrid solvers. However, their practical employment in wireless systems critically depends on the specific problem formulation, on the particular variable encoding, constraint handling, solver selection, hardware embedding, and fair benchmarking. This paper develops wireless-oriented QUBO modeling guidelines for QA-assisted resource allocation. We first present a beginner-friendly toy example in which a terrestrial-aerial resource-allocation problem with a fractional signal-to-interference-plus-noise ratio (SINR) maximization objective is reformulated into a two-bit QUBO via Boolean interpolation, converted into an Ising representation, and decoded back into a wireless scheduling decision. The same scheduling is applicable to UAV, aircraft, satellite, and terrestrial links in SAGIN systems. We then review the QA foundations and solver ecosystems, including binary quadratic, discrete quadratic, constrained quadratic, and hybrid models from the perspective of NG wireless optimization. Furthermore, we discuss both binary and discrete encoding, penalty-based constraint conversion, embedding overhead, solution decoding, and feasibility verification. A QUBO Compatibility Index is introduced as a lightweight diagnostic metric for assessing the associated QUBO formulation readiness, rather than a predictor of runtime or solution quality. Finally, a case study on max-min uplink power control in cell-free massive MIMO illustrates how a fairness-oriented wireless problem can be discretized, constrained, converted into the concept of a QUBO, and evaluated against classical baselines. A host of key challenges and future directions are also discussed.

arXiv:2610.14126•IEEE Open Journal of the Communications Society•Jan 1, 2026•0 citations

Quantum-classical hybrid algorithm using quantum annealing for multi-objective job shop scheduling

Kenta Sawamura, Kensuke Araki, Naoki Maruyama +2 more

Efficient production planning is essential in modern manufacturing to improve performance indicators such as lead time and to reduce reliance on human intuition. While mathematical optimization approaches, formulated as job shop scheduling problems, have been applied to automate this process, solving large-scale production planning problems remains computationally demanding. Moreover, many practical scenarios involve conflicting objectives, making traditional scalarization techniques ineffective in finding diverse and useful Pareto-optimal solutions. To address these challenges, we developed a quantum-classical hybrid algorithm that decomposes the problem into two subproblems: resource allocation and task scheduling. Resource allocation is formulated as a quadratic unconstrained binary optimization problem and solved using annealing-based methods that efficiently explore complex solutions. Task scheduling is modeled as a mixed-integer linear programming problem and solved using conventional solvers to satisfy detailed scheduling constraints. We validated the proposed method using benchmark instances based on foundry production scenarios. Experimental results demonstrate that our hybrid approach achieves superior solution quality and computational efficiency compared to traditional monolithic methods. This work offers a promising direction for high-speed, multi-objective scheduling in industrial applications.

quant-pharXiv:2511.03257•Journal of the Physical Society of Japan•Nov 6, 2025•7 citations

Resource-aware QAOA for autoclave batch scheduling in composite manufacturing using QUBO decomposition and parameter transfer

Abdulrazak Jinadu Otaru, Obinna Onyebuchi Barah, Ige Bori +2 more

Abstract Industrial quantum computing requires problem decompositions that respect near-term resource limits while preserving operational value. This study presents a hybrid classical-quantum workflow for autoclave batch scheduling in composite manufacturing, in which release-time and cure-family logic remain in a classical orchestration layer and each batch-selection decision is encoded as a quadratic unconstrained binary optimization (QUBO) problem. Candidate pools of 4–10 jobs produce 8–14 logical-qubit QAOA subproblems after capacity-slack encoding. Depth-1 and depth-2 QAOA were evaluated using noiseless statevector simulation, with depth-2 parameters trained on four instances per problem size and transferred without re-optimization to six held-out instances per size. For transferred depth-2 QAOA, decoded feasible probability mass decreased from 0.956 at 8 qubits to 0.427 at 14 qubits, while optimal-subset probability decreased from 0.05283 to 0.00150. Comparison with an exact uniform-sampling null showed no consistent optimal-subset concentration advantage for transferred $$\text{p}=2$$ QAOA, despite exact best-of-4096 recovery across the held-out instances. The estimated sampling budget for a 95% probability of observing the optimum increased from approximately 55 to 2000 shots. In 15 end-to-end synthetic production scenarios containing 24–48 jobs, no statistically significant differences were detected between transferred QAOA and exact per-batch selection or simulated annealing for any reported schedule metric. Relative to greedy selection, transferred QAOA increased mean autoclave utilization by 2.70% points, corresponding to a 3.3% relative increase. This was the only nominally significant paired difference against greedy selection (unadjusted Wilcoxon $$\:p=0.029$$ ); other schedule metrics improved directionally but were not statistically significant. All results were obtained using noiseless statevector simulation and establish neither quantum advantage nor hardware-level speedup, but rather a testable quantum-classical integration pathway defined by decomposition, parameter reuse, sampling burden, and classical fallback.

Scientific Reports•Nov 12, 2026•0 citations

QUBO formulations for parallel machine scheduling

Frank Phillipson, Yoseph Y. Hutten

This paper investigates several Quadratic Unconstrained Binary optimisation (QUBO) formulations for the parallel machine scheduling problem P m | | C max with the goal of assessing their suitability for quantum annealing and related heuristic optimisation methods. Three QUBO models are constructed, ranging from formulations derived from classical integer and one-hot encodings to a more compact load-balancing based representation. Extensive computational experiments using Simulated Annealing (SA) and Quantum Annealing (QA) reveal substantial differences in scalability and solution quality among the formulations. The alternative load-balanced model consistently yields near-optimal makespans, typically within 1%–3% of the theoretical lower bound, highlighting its stability and effectiveness compared to the more penalty sensitive formulations, whose performance deteriorates for larger instances. Sensitivity analyses further reveal that the appropriate selection of penalty weights and problem-specific parameter tuning significantly influences both solution accuracy and computational effort in QUBO formulations. While current quantum hardware limitations restrict experimentation to small problem sizes, the findings illustrate how compact QUBO designs can better exploit quantum optimisation frameworks. The insights gained in this study provide practical modelling guidelines for future quantum scheduling research and lay the groundwork for extending QUBO-based approaches to more complex scheduling environments. • Three QUBO formulations are compared for identical parallel machine scheduling. • A compact load-balancing QUBO avoids auxiliary variables. • Load balancing yields makespans on average within 1–3%. • Both simulated and quantum annealing produce near-optimal schedules. • Penalty selection and encoding strongly affect scalability and solution quality.

Computers & Operations Research•Sep 11, 2026•0 citations
Abstract Industry 5.0 shifts the focus of manufacturing automation toward human well-being, not just efficiency or output. This means task-allocation systems now have to juggle production targets, ergonomic safety, and what the workforce can realistically handle. Here, we introduce what we call the Ergonomics-Aware Human–Robot Task Allocation (EA-HRTA) problem. Picture it as a complex assignment challenge: for every task, we have to consider execution cost, whether the person or robot has the right skills, the workload each can take on, and the total ergonomic strain humans can safely handle. We turn this challenge into a Quadratic Unconstrained Binary Optimization (QUBO) model, so it runs on both quantum-annealing machines and gate-model quantum computers. We lay out three key contributions: first, we develop a penalty-based QUBO model and show exactly how to set penalty weights so it actually works. Second, we roll out a complete system where the very same QUBO gets sent both to a D-Wave-style simulated-annealing sampler and to our own lightweight, dependency-free QAOA statevector simulator. Finally, we’ve built and open-sourced a benchmarking suite that lets you see how quantum solutions perform next to a quick, greedy heuristic and a full-scale CBC integer programming baseline.. Across 60 runs spanning problem sizes from 9 to 240 binary variables, quantum annealing maintains a 100% constraint-feasibility rate at every scale tested, matching classical baselines closely on small instances (within 2% of the exact optimum at N = 9) but exhibiting a solution-quality gap that widens to roughly 140% at N = 240 under fixed penalty weights and a fixed annealing schedule. QAOA achieves competitive cost values only at the smallest instance tested (N = 9) and loses feasibility entirely by N = 16, consistent with known near-term gate-model scalability limits. We report a warm-start ablation seeding the annealer with the greedy solution, which does not yield a consistent improvement, and use this negative result to motivate an adaptive-penalty and problem-decomposition research direction. Rather than claiming a present-day quantum advantage, this paper contributes a reusable ergonomics-aware QUBO formulation, a transparent and reproducible benchmark methodology for the human-centric manufacturing community, and an honest empirical map of where current quantum optimization methods stand relative to classical practice at realistic shop-floor problem sizes.
Autonomous Mobile Robots (AMRs) are increasingly deployed in smart factories and intralogistics systems, yet dynamic fleet scheduling remains challenging because of growing task complexity, multi-objective requirements, and human–robot interaction. This review examines the evolution of AMR scheduling from Mixed-Integer Linear Programming (MILP), heuristics, metaheuristics, and Reinforcement Learning (RL) toward emerging quantum and hybrid quantum–classical optimization. Particular attention is given to Quadratic Unconstrained Binary Optimization (QUBO), the Quantum Approximate Optimization Algorithm (QAOA), and quantum annealing as potential approaches for representing coupled task allocation, routing, energy management, and human-safety requirements. The industrial implications of quantum-enhanced scheduling are critically discussed in terms of operational coordination, resource efficiency, human-centric collaboration, and scalability. Sector-specific opportunities and current research maturity are further assessed from an Industry 5.0 perspective. The review identifies hybrid quantum–classical architectures, dynamic QUBO formulations, Digital Twin integration, and human-aware scheduling as key research directions for advancing scalable and adaptive multi-AMR fleet coordination.
Autonomous Mobile Robots (AMRs) play an increasingly important role in flexible and reconfigurable production systems. Assigning heterogeneous tasks to multiple AMRs constitutes a combinatorial optimization problem that becomes computationally intractable as system complexity grows. This paper presents a Quadratic Unconstrained Binary Optimization (QUBO) model for AMR task assignment, integrating scheduling and resource allocation within a Hamiltonian formulation. The model is parameterized and evaluated using both exact and heuristic solvers to analyze scalability and validity across benchmark scenarios. Results demonstrate the trade-off between computational effort and solution optimality, confirming the feasibility of the QUBO representation for this problem class. The formulated model creates a basis for future implementation on quantum hardware for optimization using Quantum Annealing (QA) or the Quantum Approximate Optimization Algorithm (QAOA), thereby bridging the gap between classical optimization methods and new quantum computing paradigms.
Quantum annealing (QA) offers a physics-inspired approach for such subproblems by mapping them onto an Ising Hamiltonian, which is algebraically equivalent to a Quadratic Unconstrained Binary Optimization (QUBO) model executable on quantum annealers or hybrid solvers. However, their practical employment in wireless systems critically depends on the specific problem formulation, on the particular variable encoding, constraint handling, solver selection, hardware embedding, and fair benchmarking. This paper develops wireless-oriented QUBO modeling guidelines for QA-assisted resource allocation. We first present a beginner-friendly toy example in which a terrestrial-aerial resource-allocation problem with a fractional signal-to-interference-plus-noise ratio (SINR) maximization objective is reformulated into a two-bit QUBO via Boolean interpolation, converted into an Ising representation, and decoded back into a wireless scheduling decision. The same scheduling is applicable to UAV, aircraft, satellite, and terrestrial links in SAGIN systems. We then review the QA foundations and solver ecosystems, including binary quadratic, discrete quadratic, constrained quadratic, and hybrid models from the perspective of NG wireless optimization. Furthermore, we discuss both binary and discrete encoding, penalty-based constraint conversion, embedding overhead, solution decoding, and feasibility verification. A QUBO Compatibility Index is introduced as a lightweight diagnostic metric for assessing the associated QUBO formulation readiness, rather than a predictor of runtime or solution quality. Finally, a case study on max-min uplink power control in cell-free massive MIMO illustrates how a fairness-oriented wireless problem can be discretized, constrained, converted into the concept of a QUBO, and evaluated against classical baselines. A host of key challenges and future directions are also discussed.
Efficient production planning is essential in modern manufacturing to improve performance indicators such as lead time and to reduce reliance on human intuition. While mathematical optimization approaches, formulated as job shop scheduling problems, have been applied to automate this process, solving large-scale production planning problems remains computationally demanding. Moreover, many practical scenarios involve conflicting objectives, making traditional scalarization techniques ineffective in finding diverse and useful Pareto-optimal solutions. To address these challenges, we developed a quantum-classical hybrid algorithm that decomposes the problem into two subproblems: resource allocation and task scheduling. Resource allocation is formulated as a quadratic unconstrained binary optimization problem and solved using annealing-based methods that efficiently explore complex solutions. Task scheduling is modeled as a mixed-integer linear programming problem and solved using conventional solvers to satisfy detailed scheduling constraints. We validated the proposed method using benchmark instances based on foundry production scenarios. Experimental results demonstrate that our hybrid approach achieves superior solution quality and computational efficiency compared to traditional monolithic methods. This work offers a promising direction for high-speed, multi-objective scheduling in industrial applications.
Abstract Industrial quantum computing requires problem decompositions that respect near-term resource limits while preserving operational value. This study presents a hybrid classical-quantum workflow for autoclave batch scheduling in composite manufacturing, in which release-time and cure-family logic remain in a classical orchestration layer and each batch-selection decision is encoded as a quadratic unconstrained binary optimization (QUBO) problem. Candidate pools of 4–10 jobs produce 8–14 logical-qubit QAOA subproblems after capacity-slack encoding. Depth-1 and depth-2 QAOA were evaluated using noiseless statevector simulation, with depth-2 parameters trained on four instances per problem size and transferred without re-optimization to six held-out instances per size. For transferred depth-2 QAOA, decoded feasible probability mass decreased from 0.956 at 8 qubits to 0.427 at 14 qubits, while optimal-subset probability decreased from 0.05283 to 0.00150. Comparison with an exact uniform-sampling null showed no consistent optimal-subset concentration advantage for transferred p=2\text{p}=2p=2 QAOA, despite exact best-of-4096 recovery across the held-out instances. The estimated sampling budget for a 95% probability of observing the optimum increased from approximately 55 to 2000 shots. In 15 end-to-end synthetic production scenarios containing 24–48 jobs, no statistically significant differences were detected between transferred QAOA and exact per-batch selection or simulated annealing for any reported schedule metric. Relative to greedy selection, transferred QAOA increased mean autoclave utilization by 2.70% points, corresponding to a 3.3% relative increase. This was the only nominally significant paired difference against greedy selection (unadjusted Wilcoxon  p=0.029\:p=0.029p=0.029 ); other schedule metrics improved directionally but were not statistically significant. All results were obtained using noiseless statevector simulation and establish neither quantum advantage nor hardware-level speedup, but rather a testable quantum-classical integration pathway defined by decomposition, parameter reuse, sampling burden, and classical fallback.
This paper investigates several Quadratic Unconstrained Binary optimisation (QUBO) formulations for the parallel machine scheduling problem P m | | C max with the goal of assessing their suitability for quantum annealing and related heuristic optimisation methods. Three QUBO models are constructed, ranging from formulations derived from classical integer and one-hot encodings to a more compact load-balancing based representation. Extensive computational experiments using Simulated Annealing (SA) and Quantum Annealing (QA) reveal substantial differences in scalability and solution quality among the formulations. The alternative load-balanced model consistently yields near-optimal makespans, typically within 1%–3% of the theoretical lower bound, highlighting its stability and effectiveness compared to the more penalty sensitive formulations, whose performance deteriorates for larger instances. Sensitivity analyses further reveal that the appropriate selection of penalty weights and problem-specific parameter tuning significantly influences both solution accuracy and computational effort in QUBO formulations. While current quantum hardware limitations restrict experimentation to small problem sizes, the findings illustrate how compact QUBO designs can better exploit quantum optimisation frameworks. The insights gained in this study provide practical modelling guidelines for future quantum scheduling research and lay the groundwork for extending QUBO-based approaches to more complex scheduling environments. • Three QUBO formulations are compared for identical parallel machine scheduling. • A compact load-balancing QUBO avoids auxiliary variables. • Load balancing yields makespans on average within 1–3%. • Both simulated and quantum annealing produce near-optimal schedules. • Penalty selection and encoding strongly affect scalability and solution quality.