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