{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T23:37:24Z","timestamp":1777937844257,"version":"3.51.4"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031371042","type":"print"},{"value":"9783031371059","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-37105-9_28","type":"book-chapter","created":{"date-parts":[[2023,6,28]],"date-time":"2023-06-28T23:04:56Z","timestamp":1687993496000},"page":"421-428","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Quantum Annealing Solution to\u00a0the\u00a0Job Shop Scheduling Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2622-7097","authenticated-orcid":false,"given":"Riad","family":"Aggoune","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4119-6006","authenticated-orcid":false,"given":"Samuel","family":"Deleplanque","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,29]]},"reference":[{"key":"28_CR1","unstructured":"Aggoune, R., Deleplanque, S.: Solving the job shop scheduling problem: QUBO model and quantum annealing. In: 21st EU\/ME meeting - Emerging Optimization Methods: From Metaheuristics to Quantum Approaches, April 2023, Troyes (2023). $$\\langle $$hal-04037312$$\\rangle $$"},{"key":"28_CR2","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1140\/epjqt\/s40507-022-00123-4","volume":"9","author":"D Amaro","year":"2022","unstructured":"Amaro, D., Rosenkranz, M., Fitzpatrick, N., Hirano, K., Fiorentini, M.: A case study of variational quantum algorithms for a job shop scheduling problem. EPJ Quantum Technol. 9, 100\u2013114 (2022)","journal-title":"EPJ Quantum Technol."},{"key":"28_CR3","first-page":"100249","volume":"9","author":"G Da Col","year":"2022","unstructured":"Da Col, G., Teppan, E.C.: Industrial-size job shop scheduling with constraint programming. Oper. Res. Perspect. 9, 100249 (2022)","journal-title":"Oper. Res. Perspect."},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"6539","DOI":"10.1038\/s41598-022-10169-0","volume":"12","author":"C Carugno","year":"2022","unstructured":"Carugno, C., Ferrari Dacrema, M., Cremonesi, P.: Evaluating the job shop scheduling problem on a D-wave quantum annealer. Sci. Rep. 12, 6539 (2022). https:\/\/doi.org\/10.1038\/s41598-022-10169-0","journal-title":"Sci. Rep."},{"key":"28_CR5","first-page":"12142","volume":"33","author":"B Denkena","year":"2020","unstructured":"Denkena, B., Schinkel, F., Pirnay, J., Wilmsmeier, S.: Quantum algorithms for process parallel flexible job shop scheduling. CIRP J. Manuf. Sci. Technol. 33, 12142 (2020)","journal-title":"CIRP J. Manuf. Sci. Technol."},{"key":"28_CR6","doi-asserted-by":"publisher","unstructured":"Farhi, E., Goldstone, J., Gutmann, S.: A quantum approximate optimization algorithm (2014). https:\/\/doi.org\/10.48550\/arxiv.1411.4028","DOI":"10.48550\/arxiv.1411.4028"},{"key":"28_CR7","unstructured":"Garey, Michael R. and Johnson, David S. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., USA, 1979"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, pp. 212\u2013219 (1996)","DOI":"10.1145\/237814.237866"},{"issue":"5","key":"28_CR9","doi-asserted-by":"publisher","first-page":"5355","DOI":"10.1103\/PhysRevE.58.5355","volume":"58","author":"K Tadashi","year":"1998","unstructured":"Tadashi, K., Nishimori, H.: Quantum annealing in the transverse ising model. Phys. Rev. E 58(5), 5355 (1998)","journal-title":"Phys. Rev. E"},{"key":"28_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-030-50433-5_39","volume-title":"Computational Science \u2013 ICCS 2020","author":"K Kurowski","year":"2020","unstructured":"Kurowski, K., W\u0229glarz, J., Subocz, M., R\u00f3\u017cycki, R., Walig\u00f3ra, G.: Hybrid quantum annealing heuristic method for solving job shop scheduling problem. In: Krzhizhanovskaya, V.V., et al. (eds.) ICCS 2020. LNCS, vol. 12142, pp. 502\u2013515. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-50433-5_39"},{"issue":"2","key":"28_CR11","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1287\/opre.8.2.219","volume":"8","author":"AS Manne","year":"1960","unstructured":"Manne, A.S.: On the job-shop scheduling problem. Oper. Res. 8(2), 223 (1960). https:\/\/doi.org\/10.1287\/opre.8.2.219","journal-title":"Oper. Res."},{"key":"28_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-031-08760-8_20","volume-title":"Computational Science \u2014 ICCS 2022","author":"PU Rao","year":"2022","unstructured":"Rao, P.U., Sodhi, B.: Scheduling with multiple dispatch rules: a quantum computing approach. In: Groen, D., de Mulatier, C., Paszynski, M., Krzhizhanovskaya, V.V., Dongarra, J.J., Sloot, P.M.A. (eds.) ICCS 2022. LNCS, vol. 13353, pp. 233\u2013246. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-08760-8_20"},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Shimada, D., Shibuya, T., Shibasaki, T.: A decomposition method for makespan minimization in job-shop scheduling problem using ising machine. In: 2021 IEEE 8th International Conference on Industrial Engineering and Applications, PP. 307\u2013314 (2021)","DOI":"10.1109\/ICIEA52957.2021.9436798"},{"key":"28_CR14","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s11740-022-01145-8","volume":"17","author":"P Schworm","year":"2023","unstructured":"Schworm, P., Wu, X., Glatt, M., Aurich, J.C.: Solving flexible job shop scheduling problems in manufacturing with Quantum Annealing. Prod. Eng. Res. Dev. 17, 105\u2013115 (2023). https:\/\/doi.org\/10.1007\/s11740-022-01145-8","journal-title":"Prod. Eng. Res. Dev."},{"key":"28_CR15","unstructured":"Venturelli, D., Marchand, D.J., Rojo, G.: Quantum annealing implementation of job-shop scheduling. arXiv preprint:1506.08479, 2015"},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"Zhang, J., Lo Bianco, G., Beck, J.C.: Solving job-shop scheduling problems with QUBO-based specialized hardware. In: Proceedings of the International Conference on Automated Planning and Scheduling, vol. 32, no. 1, pp. 404\u2013412 (2022)","DOI":"10.1609\/icaps.v32i1.19826"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2023 Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-37105-9_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T04:31:32Z","timestamp":1736569892000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-37105-9_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031371042","9783031371059"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-37105-9_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"29 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science and Its Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccsa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccsa.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Custom based on Cyberchair 4","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"283","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"67","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8,5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"PHD Showcase Papers: 6(for main conf) \/ For ICCSA 2023 Workshops 876 subm sent, 350 full papers and 29 short papers accepted, additional PHD Showcase Papers: 2","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}