{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T04:07:32Z","timestamp":1779163652212,"version":"3.51.4"},"publisher-location":"Cham","reference-count":27,"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_21","type":"book-chapter","created":{"date-parts":[[2024,6,16]],"date-time":"2024-06-16T15:01:37Z","timestamp":1718550097000},"page":"203-218","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Indirect Flow-Shop Coding Using Rank: Application to Indirect QAOA"],"prefix":"10.1007","author":[{"given":"G\u00e9rard","family":"Fleury","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippe","family":"Lacomme","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Caroline","family":"Prodhon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,17]]},"reference":[{"key":"21_CR1","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":"21_CR2","unstructured":"Roy, B., Sussmann, B.: Les probl\u00e8mes d\u2019ordonnancement avec contraintes disjunctives. In: Note DS N\u00b09 bis. SEMA, Paris (1964)"},{"issue":"4","key":"21_CR3","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":"21_CR4","unstructured":"Bourreau, E., Fleury, G., Lacomme, P.: Indirect quantum approximate optimization algorithms: application to the TSP (2023). arXiv:2311.03294"},{"key":"21_CR5","unstructured":"Knuth, D.: The Art of Computer Programming - Volume 3. Sorting and Searching. 2nd edn. Addison-Wesley, Reading (1981)"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Laisant, C.A.: Sur la num\u00e9ration factorielle, application aux permutations. Bull. de la S.M.F. tome 16, 176\u2013173 (1888)","DOI":"10.24033\/bsmf.378"},{"key":"21_CR7","first-page":"101","volume":"4","author":"R Mantaci","year":"2001","unstructured":"Mantaci, R., Rakotondrajao, F.: A permutation representation that knows what Eulerian means. Discrete Math. Theor. Comput. Sci. 4, 101\u2013108 (2001)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"21_CR8","unstructured":"Hadfield, S.: Quantum algorithms for scientific computing and approximate optimization. Submitted in partial fulfillment of the requirements for the degree of doctor of Philosophy in the Graduate School of Arts and Sciences. Columbia University (2018)"},{"issue":"2","key":"21_CR9","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\u00d7ELS approach for the job-shop with a web service paradigm packaging. Expert Syst. Appl. 41(2), 544\u2013562 (2014)","journal-title":"Expert Syst. Appl."},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Anunay, F.A., Pandey, A., Kumar, S.K.: Mathematical models for multi-stage hybrid assembly flow-shop scheduling with preventive maintenance and release times. Comput. Ind. Eng. 186, 109719 (2023)","DOI":"10.1016\/j.cie.2023.109716"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Khatami, M., Salehipour, A., Cheng, T.C.E.: Flow-shop scheduling with exact delays to minimize makespan. Comput. Ind. Eng. 183, 109456 (2023)","DOI":"10.1016\/j.cie.2023.109456"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Geng, X.-N., Sun, X., Wang, J., Pan, L.: Scheduling on proportionate flow shop with job rejection and common due date assignment. Comput. Ind. Eng. 181, 109317 (2023)","DOI":"10.1016\/j.cie.2023.109317"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Mraihi, T., Driss, O.B., EL-Haouzi, H.B.: Distributed permutation\u00a0flow\u00a0shop\u00a0scheduling problem with worker flexibility:\u00a0review, trends and model proposition. Expert Syst. Appl. 238, 121947 (2023)","DOI":"10.1016\/j.eswa.2023.121947"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Neufeld, J.S., Schulz, S., Buscher, U.: A systematic\u00a0review\u00a0of multi-objective hybrid\u00a0flow\u00a0shop\u00a0scheduling. Eur. J. Oper. Res. 309, 1\u201323 (2023)","DOI":"10.1016\/j.ejor.2022.08.009"},{"key":"21_CR15","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.omega.2013.07.004","volume":"45","author":"MM Yenisey","year":"2014","unstructured":"Yenisey, M.M., Yagmahan, B.: Multi-objective permutation flow shop scheduling problem: literature review, classification and current trends. Omega 45, 119\u2013135 (2014)","journal-title":"Omega"},{"issue":"4","key":"21_CR16","first-page":"333","volume":"12","author":"J Carlier","year":"1978","unstructured":"Carlier, J.: Ordonnancements \u00e0 contraintes disjonctives. RAIRO. Recherche op\u00e9rationnelle. 12(4), 333\u2013350 (1978)","journal-title":"RAIRO. Recherche op\u00e9rationnelle."},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"2787","DOI":"10.1016\/j.aej.2021.01.030","volume":"60","author":"J Ren","year":"2021","unstructured":"Ren, J., Ye, C., Yang, F.: Solving flow-shop scheduling problem with a reinforcement learning algorithm that generalizes the value function with neural network. Alex. Eng. J. 60, 2787\u20132800 (2021)","journal-title":"Alex. Eng. J."},{"key":"21_CR18","unstructured":"Venturelli, D., Marchand, D.J.J., Rojo, G.: Quantum annealing implementation of job-shop scheduling (2016). arXiv:1506.08479v2"},{"key":"21_CR19","doi-asserted-by":"publisher","first-page":"6539","DOI":"10.1038\/s41598-022-10169-0","volume":"12","author":"C Carugno","year":"2022","unstructured":"Carugno, C., Dacrema, M.F., Cremonesi, P.: Evaluating the job shop scheduling problem on a D-wave quantum annealer. Sci. Rep. 12, 6539 (2022)","journal-title":"Sci. Rep."},{"key":"21_CR20","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 fexible job shop scheduling problems in manufacturing with Quantum Annealing. Prod. Eng. Res. Devel. 17, 105\u2013115 (2023)","journal-title":"Prod. Eng. Res. Devel."},{"issue":"2","key":"21_CR21","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1016\/j.ejor.2023.03.013","volume":"310","author":"K Kurowski","year":"2023","unstructured":"Kurowski, K., Pecynaa, T., Slysz, M., R\u00f3zycki, R., Walig\u00f3ra, G., Weglarz, J.: Application of quantum approximate optimization algorithm to job shop scheduling problem. Eur. J. Oper. Res. 310(2), 518\u2013528 (2023)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"21_CR22","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1057\/jors.1989.58","volume":"40","author":"JM Wilson","year":"1989","unstructured":"Wilson, J.M.: Alternative formulations of a flow-shop scheduling problem. J. Opl. Res. Soc. 40(4), 395\u2013399 (1989)","journal-title":"J. Opl. Res. Soc."},{"key":"21_CR23","unstructured":"Seda, M.: Mathematical models of flow-shop and job-shop scheduling problems. World Academy of Science, Engineering and Technology. 31 (2007)"},{"key":"21_CR24","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. Oper. Res. 8, 219\u2013223 (1960)","journal-title":"Oper. Res."},{"issue":"2","key":"21_CR25","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1002\/nav.3800060205","volume":"6","author":"HM Wagner","year":"1959","unstructured":"Wagner, H.M.: An integer linear-programming model for machine scheduling. Nav. Res. Logist. Q. 6(2), 131\u2013140 (1959)","journal-title":"Nav. Res. Logist. Q."},{"issue":"2","key":"21_CR26","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo, T.A., Resende, M.G.C.: Greedy adaptative search procedures. J. Glob. Optim. 6(2), 109\u2013133 (1995)","journal-title":"J. Glob. Optim."},{"key":"21_CR27","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-75514-2_1","volume-title":"HM 2007","author":"S Wolf","year":"2007","unstructured":"Wolf, S., Merz, P.: Evolutionary local search for the super-peer selection problem and the p-hub median problem. In: Bartz-Beielstein, T., et al. (eds.) HM 2007. LNCS, vol. 4771, pp. 1\u201315. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75514-2_1"}],"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_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,16]],"date-time":"2024-06-16T15:11:17Z","timestamp":1718550677000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-62912-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031629112","9783031629129"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-62912-9_21","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"}}]}}