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) 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.
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.
Quantum-inspired optimization (QIO) has emerged as a promising paradigm for solving complex combinatorial problems in industrial scheduling. While most existing studies focus on algorithmic developments and classical implementations, recent advances in nanoscale computing, including memristor-based Ising machines, photonic computing systems, and oscillatory neural networks, have created new opportunities for implementing QUBO- and Ising-based optimization through physical hardware dynamics. This survey provides a comprehensive review of QIO techniques for industrial scheduling, with a particular emphasis on their compatibility with emerging nanoscale computing platforms. We first introduce how representative scheduling problems, including job shop, flexible job shop, and resource-constrained scheduling, can be reformulated into quadratic unconstrained binary optimization (QUBO) models. We then categorize QIO methods into annealing- and Ising-based methods, evolutionary and population-based methods, hybrid quantum-classical and decomposition methods, and emerging learning-augmented approaches, and examine their computational characteristics and compatibility with QUBO or Ising hardware. Beyond algorithmic perspectives, this work highlights the potential role of specialized Ising hardware in enabling highly parallel and potentially energy-efficient optimization. We discuss how QUBO and Ising formulations can be mapped to physical energy-minimization processes in nanoscale devices, thereby providing a computational framework that connects classical optimization, quantum-inspired algorithms, and nanoscale hardware systems. Finally, we identify key challenges, including scalability, penalty calibration, and system integration, and outline future research directions toward hybrid quantum-classical computing ecosystems incorporating nanoscale optimization hardware. This survey positions QIO as a promising paradigm for next-generation intelligent manufacturing, in which optimization algorithms and nanoscale hardware are jointly developed to support low-latency and energy-efficient decision-making.
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.
Industrial engineering increasingly depends on solving large-scale optimization problems involving scheduling, routing, resource allocation, inventory control, energy management, and supply-chain coordination. Classical exact methods often become computationally expensive when problem size, uncertainty, and combinatorial complexity grow rapidly. Although practical quantum computers are still developing, quantum-inspired computing approaches have emerged as powerful alternatives that adapt principles from quantum mechanics to run on classical hardware. This paper investigates quantum-inspired computing approaches for complex optimization problems in industrial engineering. It examines methodologies including simulated annealing, tensor-network optimization, Ising formulations, quantum- inspired evolutionary algorithms, digital annealers, and hybrid classical-intelligent heuristics. Applications in production scheduling, facility layout, vehicle routing, maintenance planning, portfolio optimization, warehouse operations, and smart manufacturing are analyzed. Particular attention is given to solution quality, scalability, stochastic decision-making, real-time adaptability, and integration with Industry 4.0 data systems. Benefits include faster near-optimal solutions, improved operational efficiency, reduced energy consumption, and better responsiveness under uncertainty. Major challenges include formulation difficulty, parameter tuning, benchmarking inconsistency, interpretability, and transition barriers within traditional industrial workflows. A future roadmap is proposed involving hybrid quantum-classical ecosystems, AI- guided optimization engines, digital twins, and autonomous decision platforms. The paper concludes that quantum-inspired computing can deliver practical industrial value today by bridging the gap between conventional optimization and future quantum advantage, especially in environments where speed, flexibility, and complexity management are essential.
Abstract The convergence of quantum optimization and autonomous agentic reasoning defines a new computational frontier in large-scale resource coordination. This work introduces Q-PACT, a Quantum-Parallel Agentic Coordination Toolkit that unifies quantum optimization, fairness-driven orchestration, and adaptive multi-agent intelligence into a reproducible hybrid framework. Q-PACT addresses a key limitation in distributed and cloud-based quantum infrastructures; inefficient, inequitable scheduling of scarce quantum resources among competing agents and tasks. The proposed architecture formulates multi-agent scheduling as a Quadratic Unconstrained Binary Optimization (QUBO) model, solved through a heterogeneous pipeline integrating quantum annealing (D-Wave), variational optimization (QAOA on IonQ/Azure), and classical meta-heuristics. A noise-aware encoder, solver-adapter layer, and agentic manager collaborate to maintain fairness, adaptability, and load balance, while the QML-AURA subsystem continuously refines solver hyperparameters through feedback-driven variational learning. Q-PACT’s hybrid orchestration layer enables dynamic re-optimization, fault-tolerant fallback execution, and secure artifact exchange across distributed backends, achieving resilience under the noise and queueing constraints of NISQ-era hardware. Empirical evaluations demonstrate significant improvements in makespan reduction, workload variance, and energy minimization compared with classical heuristics, establishing the viability of quantum-assisted agentic scheduling at scale. By bridging quantum optimization paradigms, multi-agent systems, and fairness-aware orchestration, Q-PACT provides a foundational blueprint for the next generation of autonomous, cloud-integrated, and quantum-enabled coordination systems.