Solving Distributed Flexible Job Shop Scheduling Problems in the Wool Textile Industry with Quantum Annealing
Lilia Toma, Markus Zajac, Uta St\"orl

TL;DR
This paper explores using Quantum Annealing to solve complex distributed job shop scheduling problems in the wool textile industry, demonstrating potential advantages over classical methods for large-scale instances.
Contribution
It introduces a quantum annealing approach tailored for large-scale distributed flexible job shop scheduling problems based on real industry data.
Findings
QA can solve larger problem instances than classical methods.
Quantum annealing shows promising solution quality and speed.
The study provides insights into QUBO parameter tuning for industry applications.
Abstract
Many modern manufacturing companies have evolved from a single production facility to a multi-factory production environment that must manage both regionally dispersed production orders and their multi-site production steps. The availability of a range of machines in different locations capable of performing the same operation and shipping times between factories have transformed planning systems from the classic Job Shop Scheduling Problem (JSSP) to the Distributed Flexible Job Shop Scheduling Problem (DFJSP). Consequently, the complexity of production planning has increased significantly. We employ Quantum Annealing (QA) to solve the DFJSP in our research. In addition to assigning production orders to production sites, production steps are also assigned to these sites. This requirement is based on a real use case of a wool textile manufacturing company. To investigate the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsScheduling and Optimization Algorithms
