{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:14:38Z","timestamp":1750220078601,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,9]],"date-time":"2022-07-09T00:00:00Z","timestamp":1657324800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,9]]},"DOI":"10.1145\/3520304.3529033","type":"proceedings-article","created":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T15:29:44Z","timestamp":1658244584000},"page":"735-738","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Facility location problem and permutation flow shop scheduling problem"],"prefix":"10.1145","author":[{"given":"Akinola","family":"Ogunsemi","sequence":"first","affiliation":[{"name":"The Robert Gordon University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"McCall","sequence":"additional","affiliation":[{"name":"The Robert Gordon University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mathias","family":"Kern","sequence":"additional","affiliation":[{"name":"BT Applied Research"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin","family":"Lacroix","sequence":"additional","affiliation":[{"name":"The Robert Gordon University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Corsar","sequence":"additional","affiliation":[{"name":"The Robert Gordon University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gilbert","family":"Owusu","sequence":"additional","affiliation":[{"name":"BT Applied Research"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,7,19]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1057\/jors.1990.166"},{"volume-title":"The travelling thief problem: The first step in the transition from theoretical problems to realistic problems. In 2013 IEEE CEC","author":"Bonyadi M R","unstructured":"M R Bonyadi, Z Michalewicz, and L Barone. 2013. The travelling thief problem: The first step in the transition from theoretical problems to realistic problems. In 2013 IEEE CEC. IEEE, 1037--1044.","key":"e_1_3_2_1_2_1"},{"key":"e_1_3_2_1_3_1","first-page":"182","article-title":"A fast and elitist multiobjective genetic algorithm","volume":"6","author":"Deb K","year":"2002","unstructured":"K Deb, A Pratap, S Agarwal, and T A M T Meyarivan. 2002. A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE TEC 6, 2 (2002), 182--197.","journal-title":"NSGA-II. IEEE TEC"},{"key":"e_1_3_2_1_4_1","first-page":"497","article-title":"A hybrid genetic algorithm for the distributed permutation flowshop scheduling problem","volume":"4","author":"Gao J","year":"2011","unstructured":"J Gao and R Chen. 2011. A hybrid genetic algorithm for the distributed permutation flowshop scheduling problem. IJCIS 4, 4 (2011), 497--508.","journal-title":"IJCIS"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1016\/S0377-2217(98)00008-3"},{"key":"e_1_3_2_1_7_1","volume-title":"Cobra: A cooperative coevolutionary algorithm for bi-level optimization. In 2012","author":"Legillon F","year":"2012","unstructured":"F Legillon, A Liefooghe, and E Talbi. 2012. Cobra: A cooperative coevolutionary algorithm for bi-level optimization. In 2012 IEEE CEC. IEEE, 1--8."},{"key":"e_1_3_2_1_8_1","first-page":"100803","article-title":"Sustainable scheduling of distributed permutation flow-shop with non-identical factory using a knowledge-based multi-objective memetic optimization algorithm","volume":"60","author":"Lu C","year":"2021","unstructured":"C Lu, L Gao, W Gong, C Hu, X Yan, and X Li. 2021. Sustainable scheduling of distributed permutation flow-shop with non-identical factory using a knowledge-based multi-objective memetic optimization algorithm. SEC 60 (2021), 100803.","journal-title":"SEC"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1016\/j.cor.2009.06.019"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1016\/0377-2217(93)90182-M"},{"key":"e_1_3_2_1_11_1","volume-title":"EEEE 15","author":"Triantaphyllou E","year":"1998","unstructured":"E Triantaphyllou, B Shu, S N Sanchez, and T Ray. 1998. Multi-criteria decision making: an operations research approach. EEEE 15, 1998 (1998), 175--186."},{"volume-title":"A genetic algorithm for multi-component optimization problems: the case of the travelling thief problem","author":"Vieira D K S","unstructured":"D K S Vieira, G L Soares, J A Vasconcelos, and M H S Mendes. 2017. A genetic algorithm for multi-component optimization problems: the case of the travelling thief problem. In ECECCO. Springer, 18--29.","key":"e_1_3_2_1_12_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1080\/18756891.2016.1150003"},{"key":"e_1_3_2_1_14_1","first-page":"113","article-title":"An enhanced genetic algorithm for the distributed assembly permutation flowshop scheduling problem","volume":"15","author":"Zhang X","year":"2020","unstructured":"X Zhang, Xiang-Tao Li, and Ming-Hao Yin. 2020. An enhanced genetic algorithm for the distributed assembly permutation flowshop scheduling problem. IJBC 15, 2 (2020), 113--124.","journal-title":"IJBC"},{"key":"e_1_3_2_1_15_1","first-page":"257","article-title":"Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach","volume":"3","author":"Zitzler E","year":"1999","unstructured":"E Zitzler and L Thiele. 1999. Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE TEC 3, 4 (1999), 257--271.","journal-title":"IEEE TEC"},{"key":"e_1_3_2_1_16_1","first-page":"117","article-title":"Performance assessment of multiobjective optimizers: An analysis and review","volume":"7","author":"Zitzler E","year":"2003","unstructured":"E Zitzler, L Thiele, M Laumanns, C M Fonseca, and V G Da Fonseca. 2003. Performance assessment of multiobjective optimizers: An analysis and review. IEEE TEC 7, 2 (2003), 117--132.","journal-title":"IEEE TEC"}],"event":{"sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"acronym":"GECCO '22","name":"GECCO '22: Genetic and Evolutionary Computation Conference","location":"Boston Massachusetts"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference Companion"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3520304.3529033","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3520304.3529033","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:09:22Z","timestamp":1750183762000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3520304.3529033"}},"subtitle":["a linked optimisation problem"],"short-title":[],"issued":{"date-parts":[[2022,7,9]]},"references-count":15,"alternative-id":["10.1145\/3520304.3529033","10.1145\/3520304"],"URL":"https:\/\/doi.org\/10.1145\/3520304.3529033","relation":{},"subject":[],"published":{"date-parts":[[2022,7,9]]},"assertion":[{"value":"2022-07-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}