{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:12:23Z","timestamp":1750219943056,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":3,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,7,15]],"date-time":"2023-07-15T00:00:00Z","timestamp":1689379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"CINECA","award":["Italian Super Computing Resource Allocation Project Grant IA4HC_C"],"award-info":[{"award-number":["Italian Super Computing Resource Allocation Project Grant IA4HC_C"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,7,15]]},"DOI":"10.1145\/3583133.3596428","type":"proceedings-article","created":{"date-parts":[[2023,7,24]],"date-time":"2023-07-24T23:30:33Z","timestamp":1690241433000},"page":"61-62","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Local Search Strategies for Multi-Objective Flowshop Scheduling: Introducing Pareto Late Acceptance Hill Climbing"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7026-4165","authenticated-orcid":false,"given":"Francesca","family":"Da Ros","sequence":"first","affiliation":[{"name":"Intelligent Optimization Lab, University of Udine, Udine, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0299-6086","authenticated-orcid":false,"given":"Luca","family":"Di Gaspero","sequence":"additional","affiliation":[{"name":"Intelligent Optimization Lab, University of Udine, Udine, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,7,24]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1016\/j.ejor.2016.07.012"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1287\/ijoc.1070.0258"},{"volume-title":"Metaheuristics for multiobjective optimisation","author":"Paquete Luis","unstructured":"Luis Paquete , Marco Chiarandini , and Thomas St\u00fctzle . 2004. Pareto local optimum sets in the biobjective traveling salesman problem: An experimental study . In Metaheuristics for multiobjective optimisation . Springer , 177--199. Luis Paquete, Marco Chiarandini, and Thomas St\u00fctzle. 2004. Pareto local optimum sets in the biobjective traveling salesman problem: An experimental study. In Metaheuristics for multiobjective optimisation. Springer, 177--199.","key":"e_1_3_2_1_3_1"}],"event":{"sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"acronym":"GECCO '23 Companion","name":"GECCO '23 Companion: Companion Conference on Genetic and Evolutionary Computation","location":"Lisbon Portugal"},"container-title":["Proceedings of the Companion Conference on Genetic and Evolutionary Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583133.3596428","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3583133.3596428","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:48:56Z","timestamp":1750182536000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583133.3596428"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,15]]},"references-count":3,"alternative-id":["10.1145\/3583133.3596428","10.1145\/3583133"],"URL":"https:\/\/doi.org\/10.1145\/3583133.3596428","relation":{},"subject":[],"published":{"date-parts":[[2023,7,15]]},"assertion":[{"value":"2023-07-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}