{"id":"https://openalex.org/W123799167","doi":null,"title":"Algoritmos heur\u00edsticos h\u00edbridos para o problema de sequenciamento em m\u00e1quinas paralelas n\u00e3o-relacionadas com tempos de prepara\u00e7\u00e3o dependentes da sequ\u00eancia.","display_name":"Algoritmos heur\u00edsticos h\u00edbridos para o problema de sequenciamento em m\u00e1quinas paralelas n\u00e3o-relacionadas com tempos de prepara\u00e7\u00e3o dependentes da sequ\u00eancia.","alternate_titles":[],"publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W123799167","mag":"123799167"},"language":"pt","primary_location":{"id":"pmh:oai:americanae.aecid.es:3929162","doi":null,"is_oa":true,"landing_page_url":"http://www.repositorio.ufop.br/handle/123456789/3269","pdf_url":null,"source":{"id":"https://openalex.org/S4306400786","display_name":"Americanae (AECID Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"reponame:Reposit\u00f3rio Institucional da UFOP","raw_type":"info:eu-repo/semantics/masterThesis"},"parent_works":[],"lineage":["https://openalex.org/W123799167"],"child_works_count":0,"type":"dissertation","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://www.repositorio.ufop.br/handle/123456789/3269","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5060035191","display_name":"Matheus Nohra Haddad","orcid":"https://orcid.org/0000-0002-7809-0611","observed_orcids":["https://orcid.org/0000-0002-7809-0611"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Matheus Nohra Haddad","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-7809-0611","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5060035191"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"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/T12782","display_name":"Assembly Line Balancing Optimization","score":0.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/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.0,"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.8320000171661377},{"id":"https://openalex.org/keywords/sequence-dependent-setup-times","display_name":"sequence-dependent setup times","score":0.9729999899864197},{"id":"https://openalex.org/keywords/makespan-minimization","display_name":"makespan minimization","score":0.8479999899864197},{"id":"https://openalex.org/keywords/hybrid-metaheuristic-algorithm","display_name":"hybrid metaheuristic","score":0.8550000190734863},{"id":"https://openalex.org/keywords/iterated-local-search","display_name":"iterated local search","score":0.9900000095367432},{"id":"https://openalex.org/keywords/variable-neighborhood-descent","display_name":"variable neighborhood descent","score":0.9950000047683716},{"id":"https://openalex.org/keywords/path-relinking","display_name":"path relinking","score":0.9959999918937683},{"id":"https://openalex.org/keywords/grasp","display_name":"GRASP","score":0.8360000252723694},{"id":"https://openalex.org/keywords/asymmetric-traveling-salesman-problem","display_name":"asymmetric traveling salesman problem","score":0.824999988079071},{"id":"https://openalex.org/keywords/mixed-integer-programming","display_name":"mixed integer programming","score":0.6460000276565552},{"id":"https://openalex.org/keywords/local-search","display_name":"local search","score":0.671999990940094},{"id":"https://openalex.org/keywords/np-hard-combinatorial-optimization","display_name":"NP-hard combinatorial optimization","score":0.7620000243186951},{"id":"https://openalex.org/keywords/bottleneck-machines","display_name":"bottleneck machines","score":0.421999990940094}],"concepts":[{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.6220082640647888},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33447396755218506}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:americanae.aecid.es:3929162","doi":null,"is_oa":true,"landing_page_url":"http://www.repositorio.ufop.br/handle/123456789/3269","pdf_url":null,"source":{"id":"https://openalex.org/S4306400786","display_name":"Americanae (AECID Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"reponame:Reposit\u00f3rio Institucional da UFOP","raw_type":"info:eu-repo/semantics/masterThesis"},{"id":"pmh:oai:repositorio.ufop.br:123456789/3269","doi":null,"is_oa":true,"landing_page_url":"http://www.repositorio.ufop.br/handle/123456789/3269","pdf_url":null,"source":{"id":"https://openalex.org/S4306402641","display_name":"LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Cient\u00edficas)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4383465926","host_organization_name":"LA Referencia","host_organization_lineage":["https://openalex.org/I4383465926"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"instacron:UFOP","raw_type":"info:eu-repo/semantics/masterThesis"},{"id":"mag:123799167","doi":null,"is_oa":false,"landing_page_url":"https://www.repositorio.ufop.br/bitstream/123456789/3269/1/DISSERTA%c3%87%c3%83O_AlgoritmosHeur%c3%adsticosH%c3%adbridos.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":{"id":"pmh:oai:americanae.aecid.es:3929162","doi":null,"is_oa":true,"landing_page_url":"http://www.repositorio.ufop.br/handle/123456789/3269","pdf_url":null,"source":{"id":"https://openalex.org/S4306400786","display_name":"Americanae (AECID Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"reponame:Reposit\u00f3rio Institucional da UFOP","raw_type":"info:eu-repo/semantics/masterThesis"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2199556849","https://openalex.org/W7039282413","https://openalex.org/W2811243855","https://openalex.org/W2944793176","https://openalex.org/W7120418966","https://openalex.org/W2973622751","https://openalex.org/W2111253496","https://openalex.org/W2751361672","https://openalex.org/W187443199","https://openalex.org/W7120348653"],"abstract_inverted_index":{"Este":[0,225],"trabalho":[1],"aborda":[2],"o":[3,84,91,192,252,360],"problema":[4,36,81,234],"de":[5,14,40,52,67,72,87,145,152,185,207,215,222,239,254,259,263,275,289,316,331,356,381,403],"sequenciamento":[6],"em":[7,172,204,285,371],"m\u00e1quinas":[8,43],"paralelas":[9],"n\u00e3o-":[10],"relacionadas":[11],"com":[12,306],"tempos":[13],"prepara\u00e7\u00e3o":[15,68],"dependentes":[16],"da":[17,70,74,277,309,340],"sequ\u00eancia,":[18],"d\u00f3":[19],"ingl\u00eas":[20],"Unre-":[21],"lated":[22],"Parallel":[23],"Machine":[24],"Scheduling":[25],"Problem":[26],"with":[27],"Sequence":[28],"Dependent":[29],"Setup":[30],"Times,":[31],"ou":[32],"apenas":[33,229,394],"UPMSPST.":[34],"Neste":[35],"h\u00e1":[37],"um":[38,50,65,162,213,237,286,366],"conjunto":[39,287,315,326,355,380],"tarefas":[41,264],"e":[42,44,102,159,202,235,261,319,350],"a":[45,109,147,175,179,199,244,294,329,365],"cada":[46,58,200],"tarefa":[47],"est\u00e1":[48],"associado":[49],"tempo":[51,66,85],"processamento,":[53],"que":[54,190,359],"\u00e9":[55,82,96,227],"diferente":[56],"para":[57],"m\u00e1quina.":[59],"Dadas":[60],"duas":[61],"tarefas,":[62],"tamb\u00e9m":[63],"existe":[64],"dependente":[69],"sequ\u00eancia":[71],"lase":[73],"m\u00e1quina":[75,231],"utilizada.":[76],"O":[77,118,136,165],"objetivo":[78],"considerado":[79],"neste":[80,378],"minimizar":[83],"m\u00e1ximo":[86],"conclus\u00e3o":[88],"do":[89,141,233,296,305,333,344],"sequenciamento,":[90],"chamado":[92],"makes":[93],"pan.":[94],"OUPMSPST":[95],"muito":[97],"encontrado":[98],"no":[99,313,322],"\u00e2mbito":[100],"industrial":[101],"pertence":[103],"\u00e0":[104,230],"classe":[105],"NP-":[106],"dif\u00edcil.":[107],"Visando":[108],"sua":[110],"resolu\u00e7\u00e3o,":[111],"s\u00e3o":[112,194,256],"propostos":[113],"tr\u00eas":[114,173],"algoritmos":[115,270,338],"heur\u00edsticos":[116,125],"h\u00edbridos.":[117],"primeiro,":[119],"nomeado":[120,138,168],"VP,":[121],"combina":[122],"os":[123,269,336,386,395],"procedimentos":[124],"Iterated":[126],"Local":[127],"Search":[128],"(ILS),":[129],"Variable":[130],"Neighborhood":[131],"Descent":[132],"(VND)e":[133],"Path":[134],"Relinking(PR).":[135],"segundo,":[137],"GIVP,":[139],"difere":[140],"primeiro":[142,314,325],"pelo":[143,219],"fato":[144],"gerar":[146],"solu\u00e7\u00e3o":[148],"inicial":[149],"pela":[150],"fase":[151,176],"constru\u00e7\u00e3o":[153],"Greedy":[154],"Randomized":[155],"AdaptiveS":[156],"earch":[157],"Procedure(GRASP),":[158],"n\u00e3o":[160,203,383],"por":[161,209],"procedimento":[163],"guloso.":[164],"terceiro":[166],"algoritmo,":[167],"GIVMP,":[169],"diferedos":[170],"outros":[171,307,320,374],"estrat\u00e9gias:":[174],"PR":[177],"utiliza":[178,236],"estrat\u00e9gia":[180],"mix":[181],"edrelinking":[182],"ao":[183],"inv\u00e9s":[184],"backward":[186],"relinking,":[187],"as":[188],"vizinhan\u00e7as":[189],"formam":[191],"VND":[193],"usada":[195],"sem":[196],"ordem":[197,205],"aleat\u00f3ria":[198],"chamada":[201],"previamente":[206],"nida;":[208],"m,o":[210],"GIVMP":[211,334,361],"inclui":[212],"m\u00f3dulo":[214],"busca":[216],"local":[217],"feita":[218],"resolvedor":[220,226],"CPLEX12.1":[221],"programa\u00e7\u00e3o":[223,240],"matem\u00e1tica.":[224],"aplicado":[228],"gargalo":[232],"modelo":[238],"inteira":[241],"mista":[242],"base":[243],"dono":[245],"problemado":[246],"Caixeiro":[247],"Viajante":[248],"Assim\u00e9trico.":[249],"Para":[250,267],"explorar":[251],"espa\u00e7o":[253],"solu\u00e7\u00f5es":[255],"utilizados":[257,272],"movimentos":[258],"inser\u00e7\u00e3o":[260],"troca":[262],"entre":[265,283],"m\u00e1quinas.":[266],"testar":[268],"foram":[271,281,384],"dois":[273,312,337],"conjuntos":[274],"problemas-teste":[276,357],"literatura.":[278],"Inicialmente":[279],"eles":[280],"comparados":[282],"si":[284],"reduzido":[288],"inst\u00e2ncias":[290],",tendo-":[291],"severi":[292],"cado":[293],"superioridade":[295],"algoritmo":[297,302],"GIVMP.":[298],"Em":[299],"seguida,":[300],"este":[301],"foi":[303],"compara":[304],"seis":[308],"literatura,":[310,341],"sendo":[311],"problemas-":[317],"teste":[318],"quatro":[321],"Segundo.":[323],"No":[324],"veri":[327],"cou-se":[328],"superiorida":[330],"absoluta":[332],"sobre":[335],"gen\u00e9ticos":[339],"tendo-se":[342],"encontra":[343],"desvios":[345,387,396],"percentuais":[346,388],"relativos":[347,389],"m\u00e9dios":[348,390],"menores":[349],"novas":[351],"melhores":[352,398],"solu\u00e7\u00f5es.No":[353],"segundo":[354,379],"vericou-se":[358],"tem":[362],"desempenho":[363],"inferior":[364],"dos":[367,391,397,405],"algoritmos,":[368,392],"mas":[369,393],"superior":[370],"rela\u00e7\u00e3o":[372],"aos":[373],"tr\u00eas.":[375],"Observa-se,no":[376],"entanto,que":[377],"problemas,":[382],"disponibilizados":[385],"valores":[399],"encontrados,impedindo":[400],"uma":[401],"compara\u00e7\u00e3o":[402],"robustez":[404],"algoritmos.":[406]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W123799167","counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2026-11-14T11:04:58.165337","created_date":"2016-06-24T00:00:00"}
