乐胖代购免代理版

{"id":"https://openalex.org/W2013409571","doi":"https://doi.org/10.1109/cec.2014.6900245","title":"AIRP: A heuristic algorithm for solving the unrelated parallel machine scheduling problem","display_name":"AIRP: A heuristic algorithm for solving the unrelated parallel machine scheduling problem","publication_year":2014,"publication_date":"2014-07-01","ids":{"openalex":"https://openalex.org/W2013409571","doi":"https://doi.org/10.1109/cec.2014.6900245","mag":"2013409571"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2014.6900245","pdf_url":null,"source":{"id":"https://openalex.org/S4363605353","display_name":"2022 IEEE Congress on Evolutionary Computation (CEC)","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":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5065182907","display_name":"Luciano Perdig\ufffd\u00e3o Cota","orcid":"https://orcid.org/0000-0002-8385-7573"},"institutions":[{"id":"https://openalex.org/I10824318","display_name":"Universidade Federal de Ouro Preto","ror":"https://ror.org/056s65p46","country_code":"BR","type":"education","lineage":["https://openalex.org/I10824318"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Luciano Perdigao Cota","raw_affiliation_strings":["Department of Computer Science, Federal University of Ouro Preto, Brazil."],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Federal University of Ouro Preto, Brazil.","institution_ids":["https://openalex.org/I10824318"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060035191","display_name":"Matheus Nohra Haddad","orcid":"https://orcid.org/0000-0002-7809-0611"},"institutions":[{"id":"https://openalex.org/I161127581","display_name":"Universidade Federal Fluminense","ror":"https://ror.org/02rjhbb08","country_code":"BR","type":"education","lineage":["https://openalex.org/I161127581"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Matheus Nohra Haddad","raw_affiliation_strings":["Institute of Computation, Fluminense Federal University, Niter\u00f3i, Brazil"],"affiliations":[{"raw_affiliation_string":"Institute of Computation, Fluminense Federal University, Niter\u00f3i, Brazil","institution_ids":["https://openalex.org/I161127581"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006915301","display_name":"Marcone Jamilson Freitas Souza","orcid":"https://orcid.org/0000-0002-7141-357X"},"institutions":[{"id":"https://openalex.org/I10824318","display_name":"Universidade Federal de Ouro Preto","ror":"https://ror.org/056s65p46","country_code":"BR","type":"education","lineage":["https://openalex.org/I10824318"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Marcone Jamilson Freitas Souza","raw_affiliation_strings":["Department of Computer Science, Federal University of Ouro Preto, Brazil."],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Federal University of Ouro Preto, Brazil.","institution_ids":["https://openalex.org/I10824318"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101810792","display_name":"Vitor N. Coelho","orcid":"https://orcid.org/0000-0001-6616-8947"},"institutions":[{"id":"https://openalex.org/I10824318","display_name":"Universidade Federal de Ouro Preto","ror":"https://ror.org/056s65p46","country_code":"BR","type":"education","lineage":["https://openalex.org/I10824318"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Vitor Nazario Coelho","raw_affiliation_strings":["Department of Computer Science, Federal University of Ouro Preto, Brazil."],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Federal University of Ouro Preto, Brazil.","institution_ids":["https://openalex.org/I10824318"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.1,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":15,"citation_normalized_percentile":{"value":0.929232,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":89},"biblio":{"volume":null,"issue":null,"first_page":"1855","last_page":"1862"},"is_retracted":false,"is_paratext":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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9971,"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.9955,"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/iterated-local-search","display_name":"Iterated local search","score":0.63961184},{"id":"https://openalex.org/keywords/hill-climbing","display_name":"Hill climbing","score":0.5256815},{"id":"https://openalex.org/keywords/variable-neighborhood-search","display_name":"Variable neighborhood search","score":0.46882364}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6490333},{"id":"https://openalex.org/C124145224","wikidata":"https://www.wikidata.org/wiki/Q6094397","display_name":"Iterated local search","level":3,"score":0.63961184},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.627522},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6251313},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.53447586},{"id":"https://openalex.org/C135450995","wikidata":"https://www.wikidata.org/wiki/Q820272","display_name":"Hill climbing","level":2,"score":0.5256815},{"id":"https://openalex.org/C2776435737","wikidata":"https://www.wikidata.org/wiki/Q7915703","display_name":"Variable neighborhood search","level":3,"score":0.46882364},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.44807366},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.42551643},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.38570112},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.27248505},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27115256},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0},{"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":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2014.6900245","pdf_url":null,"source":{"id":"https://openalex.org/S4363605353","display_name":"2022 IEEE Congress on Evolutionary Computation (CEC)","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":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.48}],"grants":[],"datasets":[],"versions":[],"referenced_works_count":22,"referenced_works":["https://openalex.org/W1488422606","https://openalex.org/W179940750","https://openalex.org/W1980922590","https://openalex.org/W1982388391","https://openalex.org/W1982736809","https://openalex.org/W1986254541","https://openalex.org/W2002815701","https://openalex.org/W2011039300","https://openalex.org/W2013315474","https://openalex.org/W2033494440","https://openalex.org/W2042312329","https://openalex.org/W2050181853","https://openalex.org/W2078214107","https://openalex.org/W2088243692","https://openalex.org/W2092097317","https://openalex.org/W2104677896","https://openalex.org/W2140170679","https://openalex.org/W2401610261","https://openalex.org/W2791467530","https://openalex.org/W3121748795","https://openalex.org/W3149604617","https://openalex.org/W4302419487"],"related_works":["https://openalex.org/W2937685542","https://openalex.org/W2801447997","https://openalex.org/W2535266198","https://openalex.org/W2476121495","https://openalex.org/W2159875846","https://openalex.org/W2061323558","https://openalex.org/W2053571861","https://openalex.org/W2038822609","https://openalex.org/W1533229056","https://openalex.org/W1232705"],"abstract_inverted_index":{"This":[0,62],"paper":[1],"deals":[2],"with":[3,10],"the":[4,19,56,67,73,92,101,116,123,133,138,149],"Unrelated":[5],"Parallel":[6],"Machine":[7],"Scheduling":[8],"Problem":[9],"Setup":[11],"Times":[12],"(UPMSPST).":[13],"The":[14,79,94,111],"objective":[15],"is":[16,53,64,82],"to":[17,23,105],"minimize":[18],"makespan.":[20],"In":[21,45,136],"order":[22],"solve":[24],"it,":[25],"we":[26],"propose":[27],"a":[28,85],"heuristic":[29],"algorithm,":[30,47],"based":[31],"on":[32],"Iterated":[33],"Local":[34],"Search":[35],"(ILS),":[36],"Variable":[37],"Neighborhood":[38],"Descent":[39],"(VND)":[40],"and":[41,89,108,130],"Path":[42],"Relinking":[43],"(PR).":[44],"this":[46],"named":[48],"AIRP,":[49],"an":[50,70,120],"initial":[51],"solution":[52,63],"constructed":[54],"using":[55],"Adaptive":[57],"Shortest":[58],"Processing":[59],"Time":[60],"method.":[61,78],"refined":[65],"by":[66],"ILS,":[68],"having":[69],"adaptation":[71],"of":[72,87,100,128,132,148],"VND":[74],"as":[75,84],"local":[76],"search":[77],"PR":[80],"method":[81],"applied":[83],"strategy":[86],"intensification":[88],"diversification":[90],"during":[91],"search.":[93],"algorithm":[95,118,121,139],"was":[96],"tested":[97],"in":[98,126,152],"instances":[99],"literature":[102],"envolving":[103],"up":[104],"150":[106],"jobs":[107],"20":[109],"machines.":[110],"computational":[112],"experiments":[113],"show":[114],"that":[115],"proposed":[117],"outperforms":[119],"from":[122],"literature,":[124],"both":[125],"terms":[127],"quality":[129],"variability":[131],"final":[134],"solution.":[135],"addition,":[137],"established":[140],"new":[141],"best":[142],"solutions":[143],"for":[144],"more":[145],"than":[146],"80,5%":[147],"test":[150],"problems":[151],"average.":[153]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2013409571","counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2024-12-08T05:07:55.440264","created_date":"2016-06-24"}