{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T15:36:52Z","timestamp":1777909012827,"version":"3.51.4"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031629112","type":"print"},{"value":"9783031629129","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-62912-9_23","type":"book-chapter","created":{"date-parts":[[2024,6,16]],"date-time":"2024-06-16T15:01:37Z","timestamp":1718550097000},"page":"234-245","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Addressing Machine Unavailability in\u00a0Job Shop Scheduling: A Quantum Computing Approach"],"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":[[2024,6,17]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","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.) Computational Science \u2013 ICCS 2022. ICCS 2022. LNCS, vol. 13353, pp. 233\u2013246. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-08760-8_20","DOI":"10.1007\/978-3-031-08760-8_20"},{"key":"23_CR2","doi-asserted-by":"crossref","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)","DOI":"10.1140\/epjqt\/s40507-022-00123-4"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Aramon, M., et al.: Physics-inspired optimization for quadratic unconstrained problems using a digital annealer. Front. Phys. 7, 48 (2019)","DOI":"10.3389\/fphy.2019.00048"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"B\u0142a\u017cewicz, J., Breit, J., Formanowicz, P., Kubiak, W., Schmidt, G.: Heuristic algorithms for the two-machine flowshop Problem with limited machine availability. Omega J. 29, 599\u2013608 (2001)","DOI":"10.1016\/S0305-0483(01)00048-2"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Da Col, G., Teppan, E.C.: Industrial-size job shop scheduling with constraint programming. Oper. Res. Perspect. 9 (2022)","DOI":"10.1016\/j.orp.2022.100249"},{"key":"23_CR6","doi-asserted-by":"publisher","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","DOI":"10.1038\/s41598-022-10169-0"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Denkena, B., Schinkel, F., Pirnay, J., Wilmsmeier, S.: Quantum algorithms for process parallel flexible job shop scheduling. CIRP J. Manuf. Sci. Technol. 12142 (2020)","DOI":"10.1016\/j.cirpj.2021.03.006"},{"key":"23_CR8","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":"23_CR9","unstructured":"Michael, G.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., USA (1979)"},{"key":"23_CR10","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":"23_CR11","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":"23_CR12","doi-asserted-by":"crossref","unstructured":"Kirkpatrick, S., Gelatt, C.D., Jr., Vecchi, M.P.: Optimization by simulated annealing science vol. 220, p. 4598 (1983)","DOI":"10.1126\/science.220.4598.671"},{"key":"23_CR13","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"},{"key":"23_CR14","doi-asserted-by":"publisher","unstructured":"Kurowski, K., Pecyna T., Slysz R., R\u00f3\u017cycki, R., Walig\u00f3ra, G., W\u0229glarz, J.: Application of quantum approximate optimization algorithm to job shop scheduling problem. Eur. J. Oper. Res. 310, 518\u2013528 (2023). https:\/\/doi.org\/10.1016\/j.ejor.2023.03.013","DOI":"10.1016\/j.ejor.2023.03.013"},{"key":"23_CR15","doi-asserted-by":"publisher","unstructured":"Manne, A.S.: On the job-shop scheduling problem. Oper. Res. 8(2), 219\u2013223 (1960). https:\/\/doi.org\/10.1287\/opre.8.2.219","DOI":"10.1287\/opre.8.2.219"},{"key":"23_CR16","doi-asserted-by":"publisher","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.) Computational Science \u2013 ICCS 2022. ICCS 2022. LNCS, vol. 13353, pp. 233\u2013246. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-08760-8_20","DOI":"10.1007\/978-3-031-08760-8_20"},{"key":"23_CR17","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":"23_CR18","doi-asserted-by":"publisher","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","DOI":"10.1007\/s11740-022-01145-8"},{"key":"23_CR19","unstructured":"Venturelli, D., Marchand, D.J., Rojo, G.: Quantum annealing implementation of job-shop scheduling, 2015. arXiv preprint: 1506.08479"},{"key":"23_CR20","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","Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-62912-9_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,16]],"date-time":"2024-06-16T15:11:36Z","timestamp":1718550696000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-62912-9_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031629112","9783031629129"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-62912-9_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"17 June 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Metaheuristics International Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lorient","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"metic2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/mic2024.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}