{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T20:24:29Z","timestamp":1782419069637,"version":"3.54.5"},"reference-count":31,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T00:00:00Z","timestamp":1739404800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.3390\/e27020189","type":"journal-article","created":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T04:03:35Z","timestamp":1739419415000},"page":"189","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Solving Flexible Job-Shop Scheduling Problems Based on Quantum Computing"],"prefix":"10.3390","volume":"27","author":[{"given":"Kaihan","family":"Fu","sequence":"first","affiliation":[{"name":"College of Science, China University of Petroleum, Beijing 102249, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3722-5014","authenticated-orcid":false,"given":"Jianjun","family":"Liu","sequence":"additional","affiliation":[{"name":"College of Science, China University of Petroleum, Beijing 102249, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Miao","family":"Chen","sequence":"additional","affiliation":[{"name":"College of Science, China University of Petroleum, Beijing 102249, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Huiying","family":"Zhang","sequence":"additional","affiliation":[{"name":"College of Science, China University of Petroleum, Beijing 102249, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2025,2,13]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/ijoo.2021.0056","article-title":"Critical-path-search logic-based benders decomposition approaches for flexible job shop scheduling","volume":"4","author":"Naderi","year":"2022","journal-title":"INFORMS J. Optim."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1057\/jors.2011.86","article-title":"Job scheduling in virtual manufacturing cells with lot-streaming strategy: A new mathematical model formulation and a genetic algorithm approach","volume":"64","author":"Kesen","year":"2012","journal-title":"J. Oper. Res. Soc."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02023073","article-title":"Routing and scheduling in a flexible job shop by tabu search","volume":"41","author":"Brandimarte","year":"1993","journal-title":"Ann. Oper. Res."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1016\/j.ejor.2004.04.020","article-title":"A heuristic to schedule flexible job-shop in a glass factory","volume":"165","author":"Fuertes","year":"2005","journal-title":"Eur. J. Oper. Res."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"3202","DOI":"10.1016\/j.cor.2007.02.014","article-title":"A genetic algorithm for the flexible job-shop scheduling problem","volume":"3","author":"Pezzella","year":"2008","journal-title":"Comput. Oper. Res."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/j.future.2009.10.004","article-title":"An artificial immune algorithm for the flexible job-shop scheduling problem","volume":"26","author":"Bagheri","year":"2010","journal-title":"Future Gener. Comput. Syst."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.ijpe.2016.01.016","article-title":"An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem","volume":"174","author":"Li","year":"2016","journal-title":"Int. J. Prod. Econ."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/j.ejor.2017.08.021","article-title":"Solving the flexible job shop scheduling problem with sequence-dependent setup times","volume":"265","author":"Shen","year":"2018","journal-title":"Eur. J. Oper. Res."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"106156","DOI":"10.1016\/j.cor.2023.106156","article-title":"Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem","volume":"152","author":"Juvin","year":"2023","journal-title":"Comput. Oper. Res."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1111\/itor.12199","article-title":"A research survey: Review of flexible job shop scheduling techniques","volume":"23","author":"Chaudhry","year":"2016","journal-title":"Int. Trans. Oper. Res."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1809","DOI":"10.1007\/s10845-017-1350-2","article-title":"Review of job shop scheduling research and its new perspectives under Industry 4.0","volume":"30","author":"Zhang","year":"2019","journal-title":"J. Intell. Manuf."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/s10845-007-0026-8","article-title":"Mathematical modeling and heuristic approaches to flexible job shop scheduling problems","volume":"18","author":"Fattahi","year":"2007","journal-title":"J. Intell. Manuf."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"977","DOI":"10.1016\/j.apm.2012.03.020","article-title":"Evaluation of mathematical models for flexible job-shop scheduling problems","volume":"37","author":"Demir","year":"2013","journal-title":"Appl. Math. Model."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0925-5273(01)00119-0","article-title":"Job shop scheduling with alternative process plans","volume":"74","author":"Thomalla","year":"2001","journal-title":"Int. J. Prod. Econ."},{"key":"ref_15","first-page":"856","article-title":"Mixed integer goal programming models for the flexible job-shop scheduling problems with separable and non-separable sequence dependent setup times","volume":"36","author":"Yavuz","year":"2012","journal-title":"Appl. Math. Model."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"106347","DOI":"10.1016\/j.cie.2020.106347","article-title":"Mixed-integer linear programming and constraint programming formulations for solving distributed flexible job shop scheduling problem","volume":"142","author":"Meng","year":"2020","journal-title":"Comput. Ind. Eng."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"106630","DOI":"10.1016\/j.compchemeng.2019.106630","article-title":"Quantum computing based hybrid solution strategies for large-scale discrete-continuous optimization problems","volume":"132","author":"Ajagekar","year":"2020","journal-title":"Comput. Chem. Eng."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1126\/science.aah4243","article-title":"A coherent Ising machine for 2000-node optimization problems","volume":"354","author":"Inagaki","year":"2016","journal-title":"Science"},{"key":"ref_19","first-page":"eabh09521","article-title":"100,000-spin coherent Ising machine","volume":"70","author":"Honjo","year":"2021","journal-title":"Sci. Adv."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"3676","DOI":"10.1364\/OE.479903","article-title":"Speed-up coherent Ising machine with a spiking neural network","volume":"31","author":"Lu","year":"2023","journal-title":"Opt. Express"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/s43673-023-00077-4","article-title":"Recent progress on coherent computation based on quantum squeezing","volume":"33","author":"Lu","year":"2023","journal-title":"AAPPS Bull."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.mfglet.2022.03.003","article-title":"Quantum annealing based factory layout planning","volume":"32","author":"Venturelli","year":"2022","journal-title":"Manuf. Lett."},{"key":"ref_23","first-page":"32","article-title":"Improving Quantum Annealing Performance on Embedded Problems","volume":"7","author":"Zielewski","year":"2020","journal-title":"Supercomput. Front. Innov."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1140\/epjqt\/s40507-022-00123-4","article-title":"A case study of variational quantum algorithms for a job shop scheduling problem","volume":"9","author":"Amaro","year":"2022","journal-title":"EPJ Quantum Technol."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Sun, Y., Liu, J., Ma, Y., and Tresp, V. (2024, January 14\u201319). Differentiable Quantum Architecture Search for Job Shop Scheduling Problem. Proceedings of the ICASSP 2024\u20142024 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Seoul, Republic of Korea.","DOI":"10.1109\/ICASSP48485.2024.10445875"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/j.cirpj.2021.03.006","article-title":"Quantum algorithms for process parallel flexible job shop scheduling","volume":"33","author":"Denkena","year":"2021","journal-title":"CIRPJ Manuf. Sci. Technol."},{"key":"ref_27","first-page":"105","article-title":"Solving flexible job shop scheduling problems in manufacturing with Quantum Annealing","volume":"17","author":"Schworm","year":"2022","journal-title":"Prod. Manag."},{"key":"ref_28","first-page":"26","article-title":"Optimization for the Flexible Job Shop Scheduling Problems with Production Process Time","volume":"23","author":"Zhengfeng","year":"2020","journal-title":"Ind. Eng. J."},{"key":"ref_29","first-page":"2475","article-title":"Flexible job shop dual resource scheduling problem considering loading and unloading","volume":"35","author":"Wu","year":"2020","journal-title":"Control Decis."},{"key":"ref_30","first-page":"252","article-title":"Multi-objective flexible job shop scheduling method for machine tool component production line considering energy consumption and quality","volume":"34","author":"Zhu","year":"2019","journal-title":"Control Decis."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"063853","DOI":"10.1103\/PhysRevA.88.063853","article-title":"Coherent Ising machine based on degenerate optical parametric oscillators","volume":"88","author":"Wang","year":"2013","journal-title":"Phys. Rev. A"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/27\/2\/189\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T16:32:33Z","timestamp":1760027553000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/27\/2\/189"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,13]]},"references-count":31,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2025,2]]}},"alternative-id":["e27020189"],"URL":"https:\/\/doi.org\/10.3390\/e27020189","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,13]]}}}