Solving Flexible Job-Shop Scheduling Problems Based on Quantum Computing

Збережено в:

Бібліографічні деталі
Опубліковано в::	Entropy vol. 27, no. 2 (2025), p. 189
Автор:	Fu, Kaihan
Інші автори:	Liu, Jianjun, Chen, Miao, Zhang, Huiying
Опубліковано:	MDPI AG
Предмети:	Scheduling Quantum computing Integer programming Computers Mathematical models Combinatorial analysis Optimization Flexibility Variables Manufacturers Ising model Linear programming Manufacturing Feedback Energy consumption Job shop scheduling
Онлайн доступ:	Citation/Abstract Full Text + Graphics Full Text - PDF
Теги:	Додати тег Немає тегів, Будьте першим, хто поставить тег для цього запису!

Опис
Короткий огляд:	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 propose a quadratic unconstrained binary optimization (QUBO) model to minimize the makespan of FJSPs, with the scheduling scheme encoded in the ground state of the Hamiltonian operator. The model is solved using a coherent Ising machine (CIM). Numerical experiments are conducted to evaluate and validate the performance and effectiveness of the CIM. The results demonstrate that quantum computing holds significant potential for solving FJSPs more efficiently than traditional computational methods.
ISSN:	1099-4300
DOI:	10.3390/e27020189
Джерело:	Engineering Database