Quantum-classical hybrid algorithm using quantum annealing for multi-objective job shop scheduling
Kenta Sawamura, Kensuke Araki, Naoki Maruyama, Renichiro Haba, Masayuki Ohzeki

TL;DR
This paper presents a quantum-classical hybrid algorithm for multi-objective job shop scheduling, decomposing the problem into resource allocation and task scheduling to improve solution quality and efficiency.
Contribution
It introduces a novel hybrid approach combining quantum annealing for resource allocation with classical methods for scheduling, addressing multi-objective optimization challenges.
Findings
Achieves better solutions than traditional methods.
Demonstrates improved computational efficiency.
Validates effectiveness on benchmark foundry scenarios.
Abstract
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…
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 · Optimization and Packing Problems · Resource-Constrained Project Scheduling
