Solving Flexible Job-Shop Scheduling Problems Based on Quantum Computing

Flexible job-shop scheduling problems (FJSPs) represent one of the most complex combinatorial optimization challenges. Modern production systems and control processes demand rapid decision-making in scheduling. To address this challenge, we propose a quantum computing approach for solving FJSPs. We...

Full description

Bibliographic Details
Published in:Entropy
Main Authors: Kaihan Fu, Jianjun Liu, Miao Chen, Huiying Zhang
Format: Article
Language:English
Published: MDPI AG 2025-02-01
Subjects:
flexible job-shop scheduling problem
quantum computing
quadratic unconstrained binary optimization
coherent Ising machine
Online Access:https://www.mdpi.com/1099-4300/27/2/189

Internet

https://www.mdpi.com/1099-4300/27/2/189

Similar Items