QUBO-Inspired Simulated Annealing for Job-Shop Scheduling: A Benchmark Comparison with Classical Dispatching Heuristics

The paper’s significant contribution is the development of a hybrid quantum-inspired scheduling approach that combines simulated annealing, QUBO-based search, and a deterministic decoder to improve Job-Shop Scheduling solutions. Compared with traditional dispatching heuristics, the method reduced the average gap from 19.32% to 10.27% and achieved better results in 6 of 7 benchmark problems**, while maintaining reasonable computational cost.