{"id":"https://openalex.org/W2283551069","doi":null,"title":"Metaheur\u00edsticas de busca local para o problema de sequenciamento de tarefas em m\u00e1quinas paralelas n\u00e3o relacionadas com tempo de prepara\u00e7\u00e3o dependente da sequ\u00eancia.","display_name":"Metaheur\u00edsticas de busca local para o problema de sequenciamento de tarefas em m\u00e1quinas paralelas n\u00e3o relacionadas com tempo de prepara\u00e7\u00e3o dependente da sequ\u00eancia.","alternate_titles":[],"publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W2283551069","mag":"2283551069"},"language":"pt","primary_location":{"id":"mag:2283551069","doi":null,"is_oa":false,"landing_page_url":"https://www.repositorio.ufop.br/bitstream/123456789/3519/1/DISSERTA%c3%87%c3%83O_Metaheur%c3%adsticasBuscaLocal.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W2283551069"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"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/A5044497890","display_name":"Cristiano Lu\u00eds Turbino de Fran\u00e7a e Silva","orcid":"https://orcid.org/0000-0002-3569-8061","observed_orcids":["https://orcid.org/0000-0002-3569-8061"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Cristiano Lu\u00eds Turbino de Fran\u00e7a e Silva","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5044497890"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9994999766349792,"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.9994999766349792,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12177","display_name":"Resource-Constrained Project Scheduling","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/unrelated-parallel-machine-scheduling","display_name":"unrelated parallel machine scheduling","score":0.9649999737739563},{"id":"https://openalex.org/keywords/sequence-dependent-setup-times","display_name":"sequence-dependent setup times","score":0.9419999718666077},{"id":"https://openalex.org/keywords/stochastic-local-search","display_name":"stochastic local search","score":0.7979999780654907},{"id":"https://openalex.org/keywords/metaheuristic-optimization","display_name":"metaheuristic optimization","score":0.9139999747276306},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"simulated annealing","score":0.9950000047683716},{"id":"https://openalex.org/keywords/iterated-local-search","display_name":"iterated local search","score":1.0},{"id":"https://openalex.org/keywords/late-acceptance-hill-climbing","display_name":"late acceptance hill climbing","score":0.9959999918937683},{"id":"https://openalex.org/keywords/neighborhood-structure","display_name":"neighborhood structure","score":0.8240000009536743},{"id":"https://openalex.org/keywords/parameter-tuning","display_name":"parameter tuning","score":0.8209999799728394},{"id":"https://openalex.org/keywords/large-scale-instances","display_name":"large-scale instances","score":0.6010000109672546}],"concepts":[{"id":"https://openalex.org/C135450995","wikidata":"https://www.wikidata.org/wiki/Q820272","display_name":"Hill climbing","level":2,"score":0.7839871644973755},{"id":"https://openalex.org/C124145224","wikidata":"https://www.wikidata.org/wiki/Q6094397","display_name":"Iterated local search","level":3,"score":0.6946810483932495},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.5355802178382874},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5114480257034302},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.509316086769104},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.49811506271362305},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.46954354643821716},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.44928479194641113},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42742520570755005},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4136675298213959},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36716127395629883},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.35918259620666504},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2283551069","doi":null,"is_oa":false,"landing_page_url":"https://www.repositorio.ufop.br/bitstream/123456789/3519/1/DISSERTA%c3%87%c3%83O_Metaheur%c3%adsticasBuscaLocal.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2469183162","https://openalex.org/W123799167","https://openalex.org/W4205806148","https://openalex.org/W1124737490","https://openalex.org/W2765389308","https://openalex.org/W7098417989","https://openalex.org/W2005169299","https://openalex.org/W2892152077","https://openalex.org/W2013409571","https://openalex.org/W4292103287"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,6],"proposal":[4],"and":[5,54,75,90,108,146],"computational":[7],"review":[8],"of":[9,12,62,69,86,97,115],"four":[10,30],"methods":[11],"stochastic":[13],"local":[14],"search":[15,91],"to":[16],"the":[17,37,67,70,81,84,92,98,103,113,129,154],"unrelated":[18],"parallel":[19],"machine":[20],"scheduling":[21],"problem":[22],"with":[23,102],"sequence":[24],"dependent":[25],"setup":[26],"times":[27],"(UPMSP).":[28],"The":[29,60,95,125],"metaheuristics":[31],"approaches":[32],"that":[33,127],"are":[34,39],"analyzed":[35],"for":[36,138],"UPMSP":[38],"based":[40],"in:":[41],"Simulated":[42],"Annealing":[43],"(SA),":[44],"Iterated":[45],"Local":[46],"Search":[47],"(ILS),":[48],"Late":[49],"Acceptance":[50],"Hill":[51,57],"Climbing":[52,58],"(LAHC)":[53],"Step":[55],"Counting":[56],"(SCHC).":[59],"structure":[61],"neighborhoods,":[63],"as":[64,66],"well":[65],"parameters":[68,82],"algorithms,":[71],"were":[72,100],"widely":[73],"tested":[74,137],"analyzed,":[76],"being":[77],"possible":[78],"verify":[79],"how":[80],"affect":[83],"behavior":[85],"each":[87],"algorithm":[88],"implemented":[89],"best":[93,130,155],"parameters.":[94],"comparisons":[96],"results":[99,104],"accomplished":[101],"presented":[105,143],"by":[106,122,144,159],"Vallada":[107,145],"Ruiz":[109,147],"(2011),":[110,148],"who":[111],"proposed":[112],"set":[114],"50":[116,134],"instances":[117,135],"considered,":[118],"and,":[119],"more":[120],"recently,":[121],"Haddad":[123],"(2012).":[124],"method":[126],"got":[128],"result":[131],"in":[132,150],"these":[133],"was":[136],"every":[139],"1.000":[140],"large":[141],"instances,":[142],"improving":[149],"96.6%":[151],"(966":[152],"instances)":[153],"known":[156],"solution":[157],"found":[158],"this":[160],"last":[161],"authors":[162]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2283551069","counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
