{"id":"https://openalex.org/W3046742057","doi":"https://doi.org/10.1145/3377929.3398117","title":"Tabu search and iterated greedy for a flow shop scheduling problem with worker assignment","display_name":"Tabu search and iterated greedy for a flow shop scheduling problem with worker assignment","publication_year":2020,"publication_date":"2020-07-08","ids":{"openalex":"https://openalex.org/W3046742057","doi":"https://doi.org/10.1145/3377929.3398117","mag":"3046742057"},"language":"en","primary_location":{"id":"doi:10.1145/3377929.3398117","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3377929.3398117","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2020 Genetic and Evolutionary Computation Conference Companion","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5005858022","display_name":"Matheus de Freitas Araujo","orcid":null},"institutions":[{"id":"https://openalex.org/I146165071","display_name":"Universidade Federal de Vi\u00e7osa","ror":"https://ror.org/0409dgb37","country_code":"BR","type":"education","lineage":["https://openalex.org/I146165071"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Matheus de Freitas Araujo","raw_affiliation_strings":["Universidade Federal de Vi\u00e7osa, Vi\u00e7osa, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universidade Federal de Vi\u00e7osa, Vi\u00e7osa, Brazil","institution_ids":["https://openalex.org/I146165071"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048750231","display_name":"Jos\u00e9 Elias Claudio Arroyo","orcid":"https://orcid.org/0000-0003-3403-4770"},"institutions":[{"id":"https://openalex.org/I146165071","display_name":"Universidade Federal de Vi\u00e7osa","ror":"https://ror.org/0409dgb37","country_code":"BR","type":"education","lineage":["https://openalex.org/I146165071"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Jos\u00e9 Elias C. Arroyo","raw_affiliation_strings":["Universidade Federal de Vi\u00e7osa, Vi\u00e7osa, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universidade Federal de Vi\u00e7osa, Vi\u00e7osa, Brazil","institution_ids":["https://openalex.org/I146165071"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055599334","display_name":"Lucas Batista Fialho","orcid":null},"institutions":[{"id":"https://openalex.org/I146165071","display_name":"Universidade Federal de Vi\u00e7osa","ror":"https://ror.org/0409dgb37","country_code":"BR","type":"education","lineage":["https://openalex.org/I146165071"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Lucas Batista Fialho","raw_affiliation_strings":["Universidade Federal de Vi\u00e7osa, Vi\u00e7osa, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universidade Federal de Vi\u00e7osa, Vi\u00e7osa, Brazil","institution_ids":["https://openalex.org/I146165071"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I146165071"],"apc_list":null,"apc_paid":null,"fwci":1.5303,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.81010994,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1661","last_page":"1668"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12782","display_name":"Assembly Line Balancing Optimization","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9941999912261963,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/tabu-search","display_name":"Tabu search","score":0.814927339553833},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.7800920605659485},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7029500007629395},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5842854976654053},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5713352560997009},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5270198583602905},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5149977207183838},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.5096545219421387},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.49809980392456055},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29452601075172424}],"concepts":[{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.814927339553833},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.7800920605659485},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7029500007629395},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5842854976654053},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5713352560997009},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5270198583602905},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5149977207183838},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.5096545219421387},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.49809980392456055},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29452601075172424},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3377929.3398117","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3377929.3398117","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2020 Genetic and Evolutionary Computation Conference Companion","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6499999761581421,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1984423218","https://openalex.org/W1985351347","https://openalex.org/W1993433489","https://openalex.org/W1996504887","https://openalex.org/W2029346708","https://openalex.org/W2039568841","https://openalex.org/W2079661120","https://openalex.org/W2087411299","https://openalex.org/W2090069860","https://openalex.org/W2091363003","https://openalex.org/W2094464773","https://openalex.org/W2101097701","https://openalex.org/W2156391157","https://openalex.org/W2171103562","https://openalex.org/W2199221478","https://openalex.org/W2260286117","https://openalex.org/W2587256713","https://openalex.org/W2811402734","https://openalex.org/W4298339240"],"related_works":["https://openalex.org/W2321371676","https://openalex.org/W2937685542","https://openalex.org/W2967782293","https://openalex.org/W2185192838","https://openalex.org/W2955323683","https://openalex.org/W1564838499","https://openalex.org/W2069961172","https://openalex.org/W26892725","https://openalex.org/W2559484340","https://openalex.org/W2165758382"],"abstract_inverted_index":{"In":[0,26],"this":[1,86],"work":[2],"we":[3,93],"address":[4],"a":[5,95,134,150,162],"combinatorial":[6],"optimization":[7],"problem":[8,156],"composed":[9],"of":[10,15,51,123,136,164],"two":[11],"sub-problems:":[12],"the":[13,21,27,52,63,68,76,82,121,139,146,155,165,169,174],"assignment":[14,66,122],"heterogeneous":[16,31],"workers":[17,32,124],"to":[18,34,37,45,61,74,88,125],"machines":[19,54],"and":[20,41,67,103,127],"flow":[22],"shop":[23],"scheduling":[24],"problem.":[25],"studied":[28],"problem,":[29,87],"m":[30,39,53],"have":[33,44],"be":[35,46],"assigned":[36],"operate":[38],"machines,":[40,126],"n":[42],"jobs":[43,137],"scheduled":[47],"on":[48,99,138],"each":[49],"one":[50],"ordered":[55],"in":[56,72,84,173],"series.":[57],"The":[58,108,141],"objective":[59],"is":[60,117,130,149],"find":[62],"best":[64,170],"worker":[65],"corresponding":[69],"job":[70],"schedule":[71,135],"order":[73],"minimize":[75],"maximum":[77],"completion":[78],"time":[79],"(makespan).":[80],"Given":[81],"difficulty":[83],"solving":[85,154],"obtain":[89],"near":[90],"optimal":[91],"solutions,":[92],"propose":[94],"new":[96],"heuristic":[97,148,171],"based":[98],"Tabu":[100],"Search":[101],"(TS)":[102],"Iterated":[104],"Greedy":[105],"(IG)":[106],"algorithm.":[107],"TS":[109],"heuristic,":[110],"which":[111],"has":[112],"good":[113],"local":[114],"searching":[115],"ability,":[116],"responsible":[118,131],"for":[119,132,153],"defining":[120],"IG":[128],"algorithm":[129],"obtaining":[133],"machines.":[140],"experimental":[142],"results":[143,167],"show":[144],"that":[145],"proposed":[147],"state-of-the-art":[151],"method":[152],"under":[157],"study,":[158],"as":[159],"seen":[160],"through":[161],"comparison":[163],"obtained":[166],"with":[168],"available":[172],"literature.":[175]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}