{"id":"https://openalex.org/W2896597155","doi":"https://doi.org/10.1109/cec.2018.8477787","title":"Automatic Design of Heuristics for Minimizing the Makespan in Permutation Flow Shops","display_name":"Automatic Design of Heuristics for Minimizing the Makespan in Permutation Flow Shops","publication_year":2018,"publication_date":"2018-07-01","ids":{"openalex":"https://openalex.org/W2896597155","doi":"https://doi.org/10.1109/cec.2018.8477787","mag":"2896597155"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2018.8477787","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2018.8477787","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"},"type":"article","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/A5039264640","display_name":"Artur Brum","orcid":"https://orcid.org/0000-0002-6423-0660"},"institutions":[{"id":"https://openalex.org/I130442723","display_name":"Universidade Federal do Rio Grande do Sul","ror":"https://ror.org/041yk2d64","country_code":"BR","type":"education","lineage":["https://openalex.org/I130442723"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Artur Brum","raw_affiliation_strings":["Instituto de Inform\u00e1tica, Universidade Federal do Rio Grande do Sul, Porto Alegre, Brazil"],"affiliations":[{"raw_affiliation_string":"Instituto de Inform\u00e1tica, Universidade Federal do Rio Grande do Sul, Porto Alegre, Brazil","institution_ids":["https://openalex.org/I130442723"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086717490","display_name":"Marcus Ritt","orcid":"https://orcid.org/0000-0001-7894-1634"},"institutions":[{"id":"https://openalex.org/I130442723","display_name":"Universidade Federal do Rio Grande do Sul","ror":"https://ror.org/041yk2d64","country_code":"BR","type":"education","lineage":["https://openalex.org/I130442723"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Marcus Ritt","raw_affiliation_strings":["Instituto de Inform\u00e1tica, Universidade Federal do Rio Grande do Sul, Porto Alegre, Brazil"],"affiliations":[{"raw_affiliation_string":"Instituto de Inform\u00e1tica, Universidade Federal do Rio Grande do Sul, Porto Alegre, Brazil","institution_ids":["https://openalex.org/I130442723"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5039264640"],"corresponding_institution_ids":["https://openalex.org/I130442723"],"apc_list":null,"apc_paid":null,"fwci":2.2171,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.89957507,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"5","issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998999834060669,"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":0.9998999834060669,"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.9939000010490417,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9914000034332275,"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/job-shop-scheduling","display_name":"Job shop scheduling","score":0.8267400860786438},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7574549913406372},{"id":"https://openalex.org/keywords/iterated-local-search","display_name":"Iterated local search","score":0.6791020035743713},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.6721862554550171},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6573871970176697},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.5317365527153015},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5082995295524597},{"id":"https://openalex.org/keywords/grammar","display_name":"Grammar","score":0.44899648427963257},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4295504093170166},{"id":"https://openalex.org/keywords/tabu-search","display_name":"Tabu search","score":0.39888906478881836},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38971734046936035},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33076012134552},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21460798382759094},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.1062568724155426}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.8267400860786438},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7574549913406372},{"id":"https://openalex.org/C124145224","wikidata":"https://www.wikidata.org/wiki/Q6094397","display_name":"Iterated local search","level":3,"score":0.6791020035743713},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.6721862554550171},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6573871970176697},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.5317365527153015},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5082995295524597},{"id":"https://openalex.org/C26022165","wikidata":"https://www.wikidata.org/wiki/Q8091","display_name":"Grammar","level":2,"score":0.44899648427963257},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4295504093170166},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.39888906478881836},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38971734046936035},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33076012134552},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21460798382759094},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.1062568724155426},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2018.8477787","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2018.8477787","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.44999998807907104}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":50,"referenced_works":["https://openalex.org/W60686164","https://openalex.org/W1488422606","https://openalex.org/W1875189495","https://openalex.org/W1884498291","https://openalex.org/W1965349461","https://openalex.org/W1983770999","https://openalex.org/W1984701290","https://openalex.org/W1995117679","https://openalex.org/W2004274396","https://openalex.org/W2004512235","https://openalex.org/W2006751452","https://openalex.org/W2015178471","https://openalex.org/W2018028283","https://openalex.org/W2026541491","https://openalex.org/W2030910540","https://openalex.org/W2040549643","https://openalex.org/W2052516622","https://openalex.org/W2053811005","https://openalex.org/W2056760934","https://openalex.org/W2063345867","https://openalex.org/W2086738348","https://openalex.org/W2088123758","https://openalex.org/W2090069860","https://openalex.org/W2095150268","https://openalex.org/W2108910404","https://openalex.org/W2111060121","https://openalex.org/W2117332871","https://openalex.org/W2125827607","https://openalex.org/W2126800812","https://openalex.org/W2140494408","https://openalex.org/W2141119792","https://openalex.org/W2156391157","https://openalex.org/W2157846217","https://openalex.org/W2199221478","https://openalex.org/W2302057568","https://openalex.org/W2407934997","https://openalex.org/W2564072466","https://openalex.org/W2607240999","https://openalex.org/W2624035465","https://openalex.org/W2765659249","https://openalex.org/W2884652221","https://openalex.org/W2950680102","https://openalex.org/W3121748795","https://openalex.org/W3204855000","https://openalex.org/W4249638316","https://openalex.org/W6602526659","https://openalex.org/W6629144528","https://openalex.org/W6639188108","https://openalex.org/W6639252668","https://openalex.org/W6679319314"],"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":{"The":[0,81],"automatic":[1,23],"design":[2],"of":[3,22,64],"heuristic":[4],"search":[5,72],"methods":[6],"has":[7],"been":[8],"applied":[9],"successfully":[10],"to":[11,26,43,46,92],"many":[12],"optimization":[13],"problems.":[14],"In":[15],"this":[16],"paper":[17],"we":[18,74],"study":[19],"the":[20,27,62,70],"application":[21],"algorithm":[24],"configuration":[25],"permutation":[28],"flow":[29],"shop":[30],"scheduling":[31],"problem":[32],"with":[33,57],"makespan":[34],"minimization.":[35],"Our":[36],"approach":[37],"consists":[38],"in":[39],"using":[40],"a":[41,58,66,76],"grammar":[42],"determine":[44],"how":[45],"combine":[47],"individual":[48],"algorithmic":[49,71],"components":[50],"into":[51],"an":[52],"iterated":[53],"local":[54],"search,":[55],"coupled":[56],"parametric":[59],"representation":[60],"for":[61],"instantiations":[63],"such":[65],"grammar.":[67],"To":[68],"explore":[69],"space":[73],"employ":[75],"procedure":[77],"based":[78],"on":[79,86],"racing.":[80],"obtained":[82],"algorithms":[83],"are":[84],"evaluated":[85],"two":[87],"well-known":[88],"benchmarks":[89],"and":[90],"compared":[91],"state-of-the-art":[93],"heuristics.":[94]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}