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.
आईएसएसएन:	1099-4300
डिजिटल ऑब्जेक्ट पहचानकर्ता:	10.3390/e27020189
स्रोत:	Engineering Database