抄録
Steel manufacturing involves multiple processes, and optimizing the production schedule is essential for improving the quality, cost, and delivery of products. However, the corresponding optimization problems are usually NP-hard and generally intractable even for modern high-performance computers. Recent advances in quantum computers, such as those developed by D-Wave Systems, have opened new possibilities for handling this type of optimization problem. Nevertheless, a major obstacle to the application of currently available quantum computers is the relatively small number of quantum bits, which limits the feasible problem size. To overcome this obstacle, we propose an algorithm for solving optimization problems based on Lagrangian decomposition and coordination. D-Wave quantum computers can explore diverse solutions simultaneously, and we leverage this unique characteristic to obtain the upper bound for Lagrangian decomposition and coordination. We apply the proposed algorithm to a simplified problem of two-process production scheduling. By decomposing the problem into two stages for the processes, the number of steel products that can be handled increases from five to eight (60% increase). The optimal solutions are reached even for the extended case of the eight products. The proposed algorithm is a promising technique for enabling the application of quantum computers to real-world problems by thoroughly exploiting quantum bits.
