{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:32:04Z","timestamp":1750221124548,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T00:00:00Z","timestamp":1554681600000},"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":[[2019,4,8]]},"DOI":"10.1145\/3297280.3297302","type":"proceedings-article","created":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T12:18:47Z","timestamp":1556713127000},"page":"204-211","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["An effective hybrid imperialist competitive algorithm and tabu search for an extended flexible job shop scheduling problem"],"prefix":"10.1145","author":[{"given":"Willian Tessaro","family":"Lunardi","sequence":"first","affiliation":[{"name":"University of Luxembourg, Luxembourg, Luxembourg"}]},{"given":"Holger","family":"Voos","sequence":"additional","affiliation":[{"name":"University of Luxembourg, Luxembourg, Luxembourg"}]},{"given":"Luiz Henrique","family":"Cherri","sequence":"additional","affiliation":[{"name":"University of S\u00e3o Paulo, S\u00e3o Paulo, Brazil"}]}],"member":"320","published-online":{"date-parts":[[2019,4,8]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"G Gim\u00e9nez, and R Ramos.","author":"Alvarez-Vald\u00e9s Ram\u00f3n","year":"2005","unstructured":"Ram\u00f3n Alvarez-Vald\u00e9s, A Fuertes, Jos\u00e9 Manuel Tamarit, G Gim\u00e9nez, and R Ramos. 2005. A heuristic to schedule flexible job-shop in a glass factory. European journal of operational research 165, 2 (2005), 525--534."},{"key":"e_1_3_2_1_2_1","volume-title":"Rubeena Kousar, Riaz Ahmad, Mujtaba Hassan Agha, Zhang Faping, Naveed Anjum, and Umer Asgher.","author":"Amjad Muhammad Kamal","year":"2018","unstructured":"Muhammad Kamal Amjad, Shahid Ikramullah Butt, Rubeena Kousar, Riaz Ahmad, Mujtaba Hassan Agha, Zhang Faping, Naveed Anjum, and Umer Asgher. 2018. Recent Research Trends in Genetic Algorithm Based Flexible Job Shop Scheduling Problems. Mathematical Problems in Engineering 2018 (2018)."},{"key":"e_1_3_2_1_3_1","volume-title":"IEEE Congress on Evolutionary computation","author":"Atashpaz-Gargari Esmaeil","year":"2007","unstructured":"Esmaeil Atashpaz-Gargari and Caro Lucas. 2007. Imperialist competitive algorithm: an algorithm for optimization inspired by imperialistic competition. In IEEE Congress on Evolutionary computation, 2007. 4661--4667."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-013-0669-7"},{"key":"e_1_3_2_1_5_1","unstructured":"Ernesto G Birgin JE Ferreira and DP Ronconi. 2014. List scheduling and beam search methods for an extended version of the flexible job shop scheduling problem. (2014)."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1111\/itor.12199"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1614191"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-007-0026-8"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-005-0021-x"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1.2.117"},{"key":"e_1_3_2_1_11_1","volume-title":"Handbook of combinatorial optimization","author":"Glover Fred","year":"2093","unstructured":"Fred Glover and Manuel Laguna. 1998. Tabu search. In Handbook of combinatorial optimization. Springer, 2093--2229."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.04.007"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2003.810067"},{"key":"e_1_3_2_1_14_1","volume-title":"Alexander HG Rinnooy Kan, and David B Shmoys.","author":"Lawler Eugene L","year":"1993","unstructured":"Eugene L Lawler, Jan Karel Lenstra, Alexander HG Rinnooy Kan, and David B Shmoys. 1993. Sequencing and scheduling: Algorithms and complexity. Handbooks in operations research and management science 4 (1993), 445--522."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2016.01.016"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3167132.3167160"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1099-1425(200001\/02)3:1<3::AID-JOS32>3.0.CO;2-Y"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2013.12.007"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2010.08.004"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2009.09.002"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2007.06.039"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2010.526016"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-010-2642-2"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2013.02.013"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/SRII.2011.24"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2010.08.145"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2008.07.021"}],"event":{"name":"SAC '19: The 34th ACM\/SIGAPP Symposium on Applied Computing","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"Limassol Cyprus","acronym":"SAC '19"},"container-title":["Proceedings of the 34th ACM\/SIGAPP Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3297280.3297302","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3297280.3297302","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:02:14Z","timestamp":1750208534000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3297280.3297302"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,8]]},"references-count":27,"alternative-id":["10.1145\/3297280.3297302","10.1145\/3297280"],"URL":"https:\/\/doi.org\/10.1145\/3297280.3297302","relation":{},"subject":[],"published":{"date-parts":[[2019,4,8]]},"assertion":[{"value":"2019-04-08","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}