{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T03:03:09Z","timestamp":1780628589615,"version":"3.54.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T00:00:00Z","timestamp":1779062400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T00:00:00Z","timestamp":1779062400000},"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":["J Heuristics"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1007\/s10732-026-09593-6","type":"journal-article","created":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T14:54:34Z","timestamp":1779116074000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Indirect job-shop coding using rank: application to QAOA (IQAOA)"],"prefix":"10.1007","volume":"32","author":[{"given":"Eric","family":"Bourreau","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"G\u00e9rard","family":"Fleury","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6328-9479","authenticated-orcid":false,"given":"Philippe","family":"Lacomme","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,18]]},"reference":[{"key":"9593_CR1","doi-asserted-by":"publisher","first-page":"015021","DOI":"10.1088\/2058-9565\/ac3e54","volume":"7","author":"D Amaro","year":"2022","unstructured":"Amaro, D., Modica, C., Rosenkranz, M., Fiorentini, M., Benedetti, M., Lubasch, M.: Filtering variational quantum algorithms for combinatorial optimization. Quantum Sci. Technol. 7, 015021 (2022)","journal-title":"Quantum Sci. Technol."},{"issue":"2","key":"9593_CR2","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/S0377-2217(02)00758-0","volume":"149","author":"C Artigues","year":"2003","unstructured":"Artigues, C., Michelon, P., Reusser, S.: Insertion techniques for static and dynamic resource-constrained project scheduling. Eur. J. Oper. Res. 149(2), 249\u2013267 (2003)","journal-title":"Eur. J. Oper. Res."},{"key":"9593_CR3","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BF01719250","volume":"17","author":"C Bierwith","year":"1995","unstructured":"Bierwith, C.: A generalized permutation approach to jobshop scheduling with genetic algorithms. Or Spektrum 17, 87\u201392 (1995)","journal-title":"Or Spektrum"},{"key":"9593_CR4","unstructured":"Bourreau E.,\u00a0G. Fleury and P. Lacomme Mixer Hamiltonian with QAOA for Max k-coloring: numerical evaluations. arXiv:2207.11520 (2022)"},{"key":"9593_CR5","unstructured":"Bourreau E.,\u00a0G. Fleury and P. Lacomme Indirect Quantum Approximate Optimization Algorithms: application to the TSP. arXiv:2311.03294 (2023)"},{"issue":"7","key":"9593_CR6","doi-asserted-by":"publisher","first-page":"2331","DOI":"10.1016\/j.cor.2006.11.007","volume":"35","author":"A Caumond","year":"2008","unstructured":"Caumond, A., Lacomme, P., Tchernev, N.: A memetic algorithm for the job-shop with time-lags. Comput. Oper. Res. 35(7), 2331\u20132356 (2008)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"9593_CR7","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1016\/j.eswa.2013.07.080","volume":"41","author":"M Chassaing","year":"2014","unstructured":"Chassaing, M., Fontanel, J., Lacomme, P., Ren, L., Tchernev, N., Villechenon, P.: A GRASP\u00a0\u00d7\u00a0ELS approach for the job-shop with a web service paradigm packaging. Expert Syst. Appl. 41(2), 544\u2013562 (2014)","journal-title":"Expert Syst. Appl."},{"issue":"4","key":"9593_CR8","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1016\/0360-8352(96)00047-2","volume":"30","author":"A Cheng","year":"1996","unstructured":"Cheng, A., Gen, M., Tsumjimura, Y.: A tutorial survey of job-shop scheduling problems using genetic algorithms \u2013 representations. Comput. Ind. Eng. 30(4), 983\u2013997 (1996)","journal-title":"Comput. Ind. Eng."},{"key":"9593_CR9","unstructured":"Fleury G. and\u00a0P. Lacomme. A technical note for the 91-clauses SAT resolution with Indirect QAOA based approach (2023) arXiv:2402.00065"},{"key":"9593_CR10","doi-asserted-by":"crossref","unstructured":"Fleury G. and\u00a0P. Lacomme Indirect Flow-Shop coding using rank: application to Indirect QAOA. Submitted to MIC 2024. (2024)","DOI":"10.1007\/978-3-031-62912-9_21"},{"key":"9593_CR11","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Seth, R.: The complexity of flowshop and jobshop scheduling. Math. Oper. Res. 1, 117\u2013129 (1976)","journal-title":"Math. Oper. Res."},{"key":"9593_CR12","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(86)90191-8","volume":"26","author":"J Grabowski","year":"1986","unstructured":"Grabowski, J., Nowicki, E., Zdrzalka, S.: A block approach for single machine scheduling with release date\"s and due dates. European Journal of Operations Research 26, 278\u2013285 (1986)","journal-title":"European Journal of Operations Research"},{"issue":"2","key":"9593_CR13","doi-asserted-by":"publisher","first-page":"34","DOI":"10.3390\/a12020034","volume":"2","author":"S Hadfield","year":"2019","unstructured":"Hadfield, S., Wang, Z., O\u2019Gorman, B., Rieffel, E.G., Venturelli, D., Biswas, R.: From the quantum approximate optimization algorithm to a quantum alternating operator ansatz. Algorithms 2(2), 34 (2019)","journal-title":"Algorithms"},{"key":"9593_CR23","unstructured":"Knuth, D.E.: The Art of Computer Programming: Seminumerical algorithms. Addison-Wesley Publishing Company, 1981."},{"key":"9593_CR15","doi-asserted-by":"crossref","unstructured":"Lacomme P., C. Prins and W. Ramdane-Cherif. Competitive genetic algorithms for the Capacitated Arc Routing Problem and its extensions. In: EURO-GP 2001 (4th European Conference on Genetic Programming). C\u00f4me. Italy (2001)","DOI":"10.1007\/3-540-45365-2_49"},{"issue":"2","key":"9593_CR16","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1287\/opre.8.2.219","volume":"8","author":"AS Manne","year":"1960","unstructured":"Manne, A.S.: On the job-shop scheduling problem. On the job-shop scheduling problem. Oper. Res. 8(2), 219\u2013223 (1960)","journal-title":"Oper. Res."},{"key":"9593_CR17","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1966.24","author":"P Mellor","year":"1966","unstructured":"Mellor, P.: A review of Job Shop Scheduling. Oper. Res. Q. (1966). https:\/\/doi.org\/10.1057\/jors.1966.24","journal-title":"Oper. Res. Q."},{"key":"9593_CR18","doi-asserted-by":"crossref","unstructured":"Moll N., Barkoutsos, P., Bishop, L. S., Chow, J. M., Cross, A., Egger, D. J., Filipp, S., Fuhrer, A., Gambetta, J.M., Ganzhorn, M., Kandala, A., Mezzacapo, A., Muller, P., Riess, W., Salis, G., Smolin, J., Tavernelli, I., Temme, K.: Quantum optimization using variational Algorithms on near-term quantum devices (2017) arXiv:1710.01022.","DOI":"10.1088\/2058-9565\/aab822"},{"key":"9593_CR19","unstructured":"Moscato P. Memetic Algorithms: A Short Introduction. In: Corne, D., Dorigo, M., and Glover, F. (eds.). New Ideas in Optimization. McGraw-Hill. 219\u2013234 (1999)"},{"key":"9593_CR20","unstructured":"Roy, B., Sussmann, B.: Les probl\u00e8mes d\u2019ordonnancement avec contraintes disjunctives. In: Note DS N\u00b09 bis. SEMA. Paris (1964)"},{"key":"9593_CR21","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/ad9cba","author":"M Schmid","year":"2024","unstructured":"Schmid, M., Braun, S., Sollacher, R., Hartmann, M.J.: Highly efficient encoding for Job-Shop Scheduling Problems and its application on Quantum Computers. Quantum Sci. Technol. (2024). https:\/\/doi.org\/10.1088\/2058-9565\/ad9cba","journal-title":"Quantum Sci. Technol."},{"key":"9593_CR22","doi-asserted-by":"crossref","unstructured":"Yamada, T., Nakano, R.: Job-shop scheduling. In: Genetic Algorithms in Engineering Systems. Chapter 7. Editors. Ali, M. S. Zalzala,\u00a0Peter, J. Fleming. IET, pp. 263 (1997)","DOI":"10.1049\/PBCE055E_ch7"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-026-09593-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10732-026-09593-6","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-026-09593-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T02:19:26Z","timestamp":1780625966000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10732-026-09593-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,18]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["9593"],"URL":"https:\/\/doi.org\/10.1007\/s10732-026-09593-6","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,18]]},"assertion":[{"value":"6 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 April 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 April 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 May 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"No conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"No Research involving Human Participants and\/or Animals.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}],"article-number":"22"}}