{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T23:56:44Z","timestamp":1773964604425,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T00:00:00Z","timestamp":1550793600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61862041"],"award-info":[{"award-number":["61862041"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,2,22]]},"DOI":"10.1145\/3318299.3318359","type":"proceedings-article","created":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T12:10:25Z","timestamp":1558008625000},"page":"246-252","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["An Improved Hybrid Quantum Particle Swarm Optimization Algorithm for FJSP"],"prefix":"10.1145","author":[{"given":"Qiwen","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Computer and Communication, Lanzhou University of Technology, Qilihe District, Lanzhou, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Songqi","family":"Hu","sequence":"additional","affiliation":[{"name":"School of Computer and Communication, Lanzhou University of Technology, Qilihe District, Lanzhou, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,2,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCC.2007.897494"},{"key":"e_1_3_2_1_2_1","first-page":"11","article-title":"Flexible Job-Shop Scheduling Based on Immune and Simulated Annealing Principles","volume":"27","author":"Yu J.","year":"2010","journal-title":"Computer Applications."},{"key":"e_1_3_2_1_3_1","first-page":"3","article-title":"Flexible job shop scheduling based on improved immune clonal selection algorithm","volume":"42","author":"Wang L.","year":"2018","journal-title":"Journal of Nanjing University of Technology."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-016-9583-0"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICITEED.2017.8250497"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-015-1060-6"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2015.12.004"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2004.1330875"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Yang X. S. 2014. Nature-Inspired Optimization Algorithms. Elsevier Science Publishers B. V.  Yang X. S. 2014. Nature-Inspired Optimization Algorithms. Elsevier Science Publishers B. V.","DOI":"10.1016\/B978-0-12-416743-8.00005-1"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Zhang G. Gao L. Li P G etal Improved genetic algorithm for flexible job shop scheduling problem {J}.Journal of Mechanical Engineering 2009 45 (7): 145--151.  Zhang G. Gao L. Li P G et al. Improved genetic algorithm for flexible job shop scheduling problem {J}.Journal of Mechanical Engineering 2009 45 (7): 145--151.","DOI":"10.3901\/JME.2009.07.145"},{"key":"e_1_3_2_1_11_1","article-title":"Convergence analysis of quantum-behaved particle swarm optimization algorithm and study on its control parameter","volume":"59","author":"Fang W.","year":"2010","journal-title":"Acta Physica Sinica."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Van Laarhoven P. J. M. Aarts E. H. L. and Lenstra J. K. 2017. Job shop scheduling by simulated annealing. Operations Research. 40 1(Jan. 2017) 113--125.  Van Laarhoven P. J. M. Aarts E. H. L. and Lenstra J. K. 2017. Job shop scheduling by simulated annealing. Operations Research. 40 1(Jan. 2017) 113--125.","DOI":"10.1287\/opre.40.1.113"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Smutnicki N. C. 1996. A fast taboo search algorithm for the job shop problem. Management Science. 42 6(June. 1996) 797--813.  Smutnicki N. C. 1996. A fast taboo search algorithm for the job shop problem. Management Science. 42 6(June. 1996) 797--813.","DOI":"10.1287\/mnsc.42.6.797"},{"key":"e_1_3_2_1_14_1","unstructured":"Li S. and Li P. 2009. Quantum computation and quantum optimization algorithm. Harbin Institute of Technology press.  Li S. and Li P. 2009. Quantum computation and quantum optimization algorithm. Harbin Institute of Technology press."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/160231.160247"},{"key":"e_1_3_2_1_16_1","unstructured":"Zhu H. He B. 2017. Variable Neighborhood Search Migratory Bird Optimization Algorithm for Flexible Job Shop Scheduling. Microelectronics and Computer. 34 4(Apr. 2017) 28--32.  Zhu H. He B. 2017. Variable Neighborhood Search Migratory Bird Optimization Algorithm for Flexible Job Shop Scheduling. Microelectronics and Computer. 34 4(Apr. 2017) 28--32."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2014.889328"}],"event":{"name":"ICMLC '19: 2019 11th International Conference on Machine Learning and Computing","location":"Zhuhai China","acronym":"ICMLC '19","sponsor":["Southwest Jiaotong University"]},"container-title":["Proceedings of the 2019 11th International Conference on Machine Learning and Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3318299.3318359","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3318299.3318359","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:02:24Z","timestamp":1750208544000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3318299.3318359"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,22]]},"references-count":17,"alternative-id":["10.1145\/3318299.3318359","10.1145\/3318299"],"URL":"https:\/\/doi.org\/10.1145\/3318299.3318359","relation":{},"subject":[],"published":{"date-parts":[[2019,2,22]]},"assertion":[{"value":"2019-02-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}