Optimizing Heat Treatment Schedules via QUBO Formulation
Open Access
- 11 August 2025
- journal article
- research article
- Published by MDPI AG in Applied Sciences
- Vol. 15 (16) , 8847
Abstract
Quadratic Unconstrained Binary Optimization (QUBO) is the problem of finding binary variable assignments that minimize a given quadratic objective function. Many combinatorial optimization problems can be transformed into equivalent QUBO formulations, and significant research efforts have been devoted to developing efficient QUBO solvers. This paper presents a method for converting a real-world, industrial-scale scheduling problem arising in the heat treatment process of metal parts into an equivalent QUBO formulation. In current operations, two experienced operators manually spend about two hours each day to create a 24 h schedule for two furnaces, considering various constraints and processing priorities. We have developed a C++-based scheduling system that automatically converts this problem into a QUBO instance and solves it using QUBO++, a high-performance toolkit we have recently developed and released. The experimental results on actual scheduling instances show that QUBO++ consistently produces high-quality solutions in a short time, leveraging the computational merits of the QUBO formulation. The system reduces the labor equivalent to two hours of expert work per day, indicating that automated scheduling via QUBO++ is a promising approach for improving efficiency and accuracy in factory operations.Keywords
This publication has 36 references indexed in Scilit:
- Multi-objective Quantum Annealing approach for solving flexible job shop scheduling in manufacturingJournal of Manufacturing Systems, 2023
- Survey of integrated flexible job shop scheduling problemsComputers & Industrial Engineering, 2022
- Solving flexible job shop scheduling problems in manufacturing with Quantum AnnealingProduction Engineering, 2022
- High‐throughput FPGA implementation for quadratic unconstrained binary optimizationConcurrency and Computation: Practice and Experience, 2021
- Quantum algorithms for process parallel flexible job shop schedulingCIRP Journal of Manufacturing Science and Technology, 2021
- Mixed-integer linear programming and constraint programming formulations for solving distributed flexible job shop scheduling problemComputers & Industrial Engineering, 2020
- QUBO formulations for the graph isomorphism problem and related problemsTheoretical Computer Science, 2017
- A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing timesComputers & Operations Research, 2012
- Deterministic job-shop scheduling: Past, present and futureEuropean Journal of Operational Research, 1999
- Applying tabu search to the job-shop scheduling problemAnnals of Operations Research, 1993