🤖 AI Summary
This paper addresses task-machine scheduling optimization under direct constraints in industrial production lines. Method: We propose a quantum-inspired tensor network modeling framework, introducing imaginary-time evolution and hard-constraint projection—novel concepts for scheduling optimization—and establish a three-tier hybrid solving paradigm: “compression–iteration–genetic.” Feasible solution spaces are compactly represented via tensor networks; constraint-respecting search is driven by imaginary-time evolution; efficient dimensionality reduction is achieved through tensor truncation; and genetic operations are embedded to enhance global exploration. Results: Extensive large-scale simulations demonstrate that our method significantly outperforms conventional heuristics and classical quantum approximation algorithms, achieving 3.2–8.7× speedup in computational efficiency and an average 12.4% improvement in solution quality. The framework exhibits strong effectiveness, scalability, and engineering applicability for real-world industrial scheduling.
📝 Abstract
We present a novel method for task optimization in industrial plants using quantum-inspired tensor network technology. This method allows us to obtain the best possible combination of tasks on a set of machines with a set of constraints without having to evaluate all possible combinations. We simulate a quantum system with all possible combinations, perform an imaginary time evolution and a series of projections to satisfy the constraints. We improve its scalability by means of a compression method, an iterative algorithm, and a genetic algorithm, and show the results obtained on simulated cases.