{"id":"https://openalex.org/W3173494480","doi":"https://doi.org/10.1145/3449639.3459344","title":"The tiebreaking space of constructive heuristics for the permutation flowshop minimizing makespan","display_name":"The tiebreaking space of constructive heuristics for the permutation flowshop minimizing makespan","publication_year":2021,"publication_date":"2021-06-21","ids":{"openalex":"https://openalex.org/W3173494480","doi":"https://doi.org/10.1145/3449639.3459344","mag":"3173494480"},"language":"en","primary_location":{"id":"doi:10.1145/3449639.3459344","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3449639.3459344","pdf_url":null,"source":{"id":"https://openalex.org/S4363608932","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference","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/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":true,"raw_author_name":"Marcus Ritt","raw_affiliation_strings":["Universidade Federal do Rio Grande do Sul, Porto Alegre, Rio Grande do Sul, Brasil"],"affiliations":[{"raw_affiliation_string":"Universidade Federal do Rio Grande do Sul, Porto Alegre, Rio Grande do Sul, Brasil","institution_ids":["https://openalex.org/I130442723"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006581309","display_name":"Alexander J. Benavides","orcid":"https://orcid.org/0000-0002-1316-7171"},"institutions":[{"id":"https://openalex.org/I3130590570","display_name":"National University of Saint Augustine","ror":"https://ror.org/01e9gfg41","country_code":"PE","type":"education","lineage":["https://openalex.org/I3130590570"]}],"countries":["PE"],"is_corresponding":false,"raw_author_name":"Alexander J. Benavides","raw_affiliation_strings":["Universidad Nacional de San Agustin de Arequipa, Arequipa, Per\u00fa"],"affiliations":[{"raw_affiliation_string":"Universidad Nacional de San Agustin de Arequipa, Arequipa, Per\u00fa","institution_ids":["https://openalex.org/I3130590570"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5086717490"],"corresponding_institution_ids":["https://openalex.org/I130442723"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.09923274,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"36","issue":null,"first_page":"270","last_page":"277"},"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.9965999722480774,"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.9965000152587891,"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.8294934034347534},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.795150637626648},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.7052978277206421},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.6834902763366699},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.6822062134742737},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6170545816421509},{"id":"https://openalex.org/keywords/circuit-breaker","display_name":"Circuit breaker","score":0.5729811191558838},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5561997294425964},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5293529629707336},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4620892405509949},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33872196078300476},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.13146629929542542},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.10873422026634216},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.06118065118789673}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.8294934034347534},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.795150637626648},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.7052978277206421},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.6834902763366699},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.6822062134742737},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6170545816421509},{"id":"https://openalex.org/C61352017","wikidata":"https://www.wikidata.org/wiki/Q211058","display_name":"Circuit breaker","level":2,"score":0.5729811191558838},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5561997294425964},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5293529629707336},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4620892405509949},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33872196078300476},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.13146629929542542},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.10873422026634216},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.06118065118789673},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C119599485","wikidata":"https://www.wikidata.org/wiki/Q43035","display_name":"Electrical engineering","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3449639.3459344","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3449639.3459344","pdf_url":null,"source":{"id":"https://openalex.org/S4363608932","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.4699999988079071,"id":"https://metadata.un.org/sdg/8"}],"awards":[{"id":"https://openalex.org/G4041860217","display_name":null,"funder_award_id":"437859/2018-5","funder_id":"https://openalex.org/F4320322025","funder_display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico"},{"id":"https://openalex.org/G5859020988","display_name":null,"funder_award_id":"001","funder_id":"https://openalex.org/F4320321091","funder_display_name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior"}],"funders":[{"id":"https://openalex.org/F4320321091","display_name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","ror":"https://ror.org/00x0ma614"},{"id":"https://openalex.org/F4320322025","display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","ror":"https://ror.org/03swz6y49"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W234104286","https://openalex.org/W331797721","https://openalex.org/W1488422606","https://openalex.org/W1843322475","https://openalex.org/W1965349461","https://openalex.org/W1993433489","https://openalex.org/W1995117679","https://openalex.org/W2002692271","https://openalex.org/W2006751452","https://openalex.org/W2009038382","https://openalex.org/W2015178471","https://openalex.org/W2019192981","https://openalex.org/W2024085737","https://openalex.org/W2032257665","https://openalex.org/W2039599707","https://openalex.org/W2040549643","https://openalex.org/W2049813155","https://openalex.org/W2053811005","https://openalex.org/W2059073981","https://openalex.org/W2063345867","https://openalex.org/W2083289500","https://openalex.org/W2086738348","https://openalex.org/W2090069860","https://openalex.org/W2111060121","https://openalex.org/W2125827607","https://openalex.org/W2149027038","https://openalex.org/W2149828135","https://openalex.org/W2157846217","https://openalex.org/W2488049019","https://openalex.org/W2530577942","https://openalex.org/W2564072466","https://openalex.org/W2587256713","https://openalex.org/W2624035465","https://openalex.org/W2896597155","https://openalex.org/W2967278017","https://openalex.org/W3001967193"],"related_works":["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","https://openalex.org/W1971939018","https://openalex.org/W3155166764"],"abstract_inverted_index":{"There":[0],"has":[1],"been":[2],"intensive":[3],"research":[4],"on":[5,52,81],"tiebreakers":[6,50],"for":[7,38],"insertion-based":[8],"constructive":[9,78],"heuristics":[10],"in":[11,87],"the":[12,19,24,31,39,46,88,100],"permutation":[13],"flow":[14],"shop":[15],"scheduling":[16],"problem":[17],"when":[18],"objective":[20],"is":[21],"to":[22],"minimize":[23],"makespan.":[25],"In":[26],"this":[27,53],"paper":[28],"we":[29],"analyze":[30],"space":[32,89],"of":[33,48,90],"all":[34,91],"possible":[35],"tie-breaking":[36],"rules":[37],"most":[40],"common":[41],"insertion":[42],"orders,":[43],"and":[44,94],"evaluate":[45],"efficacy":[47],"existing":[49],"based":[51,80],"analysis.":[54],"We":[55,75],"find":[56],"that":[57,65,96,102],"an":[58,104],"optimal":[59,105],"tie":[60,73,92,106],"breaker":[61,107],"would":[62],"produce":[63],"results":[64],"are":[66],"about":[67],"1%":[68],"better":[69],"than":[70],"current":[71],"best":[72],"breakers.":[74],"propose":[76],"a":[77,82],"heuristic":[79],"truncated":[83],"cyclic":[84],"best-first":[85],"search":[86],"breakers":[93],"show":[95],"it":[97],"closely":[98],"approximates":[99],"solutions":[101],"such":[103],"can":[108],"achieve.":[109]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}