{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:47:14Z","timestamp":1743014834450,"version":"3.40.3"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031265037"},{"type":"electronic","value":"9783031265044"}],"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-26504-4_40","type":"book-chapter","created":{"date-parts":[[2023,2,22]],"date-time":"2023-02-22T08:02:59Z","timestamp":1677052979000},"page":"506-512","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Scatter Search Approach for\u00a0the\u00a0Parallel Row Ordering Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9396-5375","authenticated-orcid":false,"given":"Raul","family":"Mart\u00edn-Santamar\u00eda","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7490-9450","authenticated-orcid":false,"given":"Jose Manuel","family":"Colmenar","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4532-3124","authenticated-orcid":false,"given":"Abraham","family":"Duarte","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,23]]},"reference":[{"key":"40_CR1","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/j.cie.2017.03.015","volume":"107","author":"A Ahmadi","year":"2017","unstructured":"Ahmadi, A., Pishvaee, M.S., Jokar, M.R.A.: A survey on multi-floor facility layout problems. Comput. Ind. Eng. 107, 158\u2013170 (2017)","journal-title":"Comput. Ind. Eng."},{"issue":"12","key":"40_CR2","doi-asserted-by":"publisher","first-page":"2930","DOI":"10.1016\/j.cor.2013.07.003","volume":"40","author":"AR Amaral","year":"2013","unstructured":"Amaral, A.R.: A parallel ordering problem in facilities layout. Comput. Oper. Res. 40(12), 2930\u20132939 (2013)","journal-title":"Comput. Oper. Res."},{"key":"40_CR3","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, vol. 174. Freeman, San Francisco (1979)"},{"issue":"1","key":"40_CR4","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1111\/j.1540-5915.1977.tb01074.x","volume":"8","author":"F Glover","year":"1977","unstructured":"Glover, F.: Heuristics for integer programming using surrogate constraints. Decis. Sci. 8(1), 156\u2013166 (1977)","journal-title":"Decis. Sci."},{"key":"40_CR5","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.jmsy.2020.11.014","volume":"58","author":"J Gong","year":"2021","unstructured":"Gong, J., Zhang, Z., Liu, J., Guan, C., Liu, S.: Hybrid algorithm of harmony search for dynamic parallel row ordering problem. J. Manuf. Syst. 58, 159\u2013175 (2021)","journal-title":"J. Manuf. Syst."},{"key":"40_CR6","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.orp.2016.09.002","volume":"3","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Dubois-Lacoste, J., P\u00e9rez C\u00e1ceres, L., St\u00fctzle, T., Birattari, M.: The irace package: iterated racing for automatic algorithm configuration. Oper. Res. Perspect. 3, 43\u201358 (2016). https:\/\/doi.org\/10.1016\/j.orp.2016.09.002","journal-title":"Oper. Res. Perspect."},{"issue":"2","key":"40_CR7","first-page":"467","volume":"10","author":"M Maadi","year":"2017","unstructured":"Maadi, M., Javidnia, M., Jamshidi, R.: Two strategies based on meta-heuristic algorithms for parallel row ordering problem (PROP). Iran. J. Manag. Stud. 10(2), 467\u2013498 (2017)","journal-title":"Iran. J. Manag. Stud."},{"key":"40_CR8","doi-asserted-by":"publisher","unstructured":"Mart\u00ed, R., Corber\u00e1n, \u00c1., Peir\u00f3, J.: Scatter search. In: Mart\u00ed, R., Pardalos, P., Resende, M. (eds.) Handbook of Heuristics, pp. 717\u2013740. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-07124-4_20","DOI":"10.1007\/978-3-319-07124-4_20"},{"issue":"3","key":"40_CR9","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1080\/01605682.2018.1556570","volume":"71","author":"X Yang","year":"2020","unstructured":"Yang, X., Cheng, W., Smith, A.E., Amaral, A.R.S.: An improved model for the parallel row ordering problem. J. Oper. Res. Soc. 71(3), 475\u2013490 (2020)","journal-title":"J. Oper. Res. Soc."}],"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-26504-4_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T08:05:24Z","timestamp":1688198724000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-26504-4_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031265037","9783031265044"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-26504-4_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"23 February 2023","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":"Ortigia-Syracuse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"metic2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ants-lab.it\/mic2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"72","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":"48","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":"17","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":"67% - 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":"3","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":"3","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}