乐胖代购免代理版

{"id":"https://openalex.org/W2089901413","doi":"https://doi.org/10.1109/sccc.2012.25","title":"GARP: A New Genetic Algorithm for the Unrelated Parallel Machine Scheduling Problem with Setup Times","display_name":"GARP: A New Genetic Algorithm for the Unrelated Parallel Machine Scheduling Problem with Setup Times","publication_year":2012,"publication_date":"2012-11-01","ids":{"openalex":"https://openalex.org/W2089901413","doi":"https://doi.org/10.1109/sccc.2012.25","mag":"2089901413"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/sccc.2012.25","pdf_url":null,"source":null,"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/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":["Inst. of Comput., Fluminense Fed. Univ., Niteroi, Brazil"],"affiliations":[{"raw_affiliation_string":"Inst. of Comput., Fluminense Fed. Univ., Niteroi, Brazil","institution_ids":["https://openalex.org/I161127581"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016712083","display_name":"Igor Machado Coelho","orcid":"https://orcid.org/0000-0001-6373-4907"},"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":"Igor Machado Coelho","raw_affiliation_strings":["Inst. of Comput., Fluminense Fed. Univ., Niteroi, Brazil"],"affiliations":[{"raw_affiliation_string":"Inst. of Comput., Fluminense Fed. Univ., Niteroi, 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/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":"Marcone Jamilson Freitas Souza","raw_affiliation_strings":["Inst. of Comput., Fluminense Fed. Univ., Niteroi, Brazil"],"affiliations":[{"raw_affiliation_string":"Inst. of Comput., Fluminense Fed. Univ., Niteroi, Brazil","institution_ids":["https://openalex.org/I161127581"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016430153","display_name":"Luiz Satoru Ochi","orcid":"https://orcid.org/0000-0002-5007-4513"},"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":"Luiz Satoru Ochi","raw_affiliation_strings":["Inst. of Comput., Fluminense Fed. Univ., Niteroi, Brazil"],"affiliations":[{"raw_affiliation_string":"Inst. of Comput., Fluminense Fed. Univ., Niteroi, Brazil","institution_ids":["https://openalex.org/I161127581"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053524534","display_name":"Haroldo Gambini Santos","orcid":"https://orcid.org/0000-0002-4759-0680"},"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":"Haroldo Gambini Santos","raw_affiliation_strings":["Dept. of Comput., Fed. Univ. of Ouro Preto, Ouro Preto, Brazil"],"affiliations":[{"raw_affiliation_string":"Dept. of Comput., Fed. Univ. of Ouro Preto, Ouro Preto, Brazil","institution_ids":["https://openalex.org/I10824318"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005451679","display_name":"Alexandre Xavier Martins","orcid":"https://orcid.org/0000-0001-6488-6881"},"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":"Alexandre Xavier Martins","raw_affiliation_strings":["Dept. of Comput., Fed. Univ. of Ouro Preto, Ouro Preto, Brazil"],"affiliations":[{"raw_affiliation_string":"Dept. of Comput., Fed. Univ. of Ouro Preto, 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":0.772,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":6,"citation_normalized_percentile":{"value":0.879225,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":81,"max":82},"biblio":{"volume":"19","issue":null,"first_page":"152","last_page":"160"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9999,"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.9999,"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.9974,"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.9968,"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/benchmark","display_name":"Benchmark (surveying)","score":0.5925595}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.7057605},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6720974},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5925595},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5912064},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5669406},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.526794},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5022259},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49499887},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.47126555},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4418127},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33152562},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"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/sccc.2012.25","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.41}],"grants":[],"datasets":[],"versions":[],"referenced_works_count":24,"referenced_works":["https://openalex.org/W1488422606","https://openalex.org/W179940750","https://openalex.org/W1975442866","https://openalex.org/W1980922590","https://openalex.org/W1982736809","https://openalex.org/W2002815701","https://openalex.org/W2004882088","https://openalex.org/W2010334716","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/W2104677896","https://openalex.org/W2140170679","https://openalex.org/W2167890839","https://openalex.org/W2401610261","https://openalex.org/W2476096155","https://openalex.org/W2600961830","https://openalex.org/W2791467530","https://openalex.org/W2997776631","https://openalex.org/W4292872700","https://openalex.org/W4302419487"],"related_works":["https://openalex.org/W4306878646","https://openalex.org/W4281297310","https://openalex.org/W3157689847","https://openalex.org/W3005108979","https://openalex.org/W2913191894","https://openalex.org/W2361554335","https://openalex.org/W2359992618","https://openalex.org/W2164188042","https://openalex.org/W2054495636","https://openalex.org/W1525389557"],"abstract_inverted_index":{"This":[0,58],"work":[1],"addresses":[2],"the":[3,16,23,31,45,93,103,119,132,146,149],"Unrelated":[4],"Parallel":[5],"Machine":[6],"Scheduling":[7],"Problem":[8,97],"where":[9],"setup":[10],"times":[11],"are":[12],"sequence-dependent":[13],"and":[14,42,72,109,118,140],"machine-dependent,":[15],"UPMSPST.":[17],"The":[18,35,99],"maximum":[19],"completion":[20],"time":[21],"of":[22,148],"schedule,":[24],"known":[25],"as":[26,30],"makespan,":[27],"is":[28,37,52,60,78,125],"considered":[29],"objective":[32],"to":[33,44,49,91,127],"minimize.":[34],"UPMSPST":[36],"often":[38],"found":[39,134],"in":[40,135],"industries":[41],"belongs":[43],"NP-hard":[46],"class.":[47],"Aiming":[48],"its":[50],"resolution,":[51],"proposed":[53],"an":[54],"algorithm":[55,59,101],"named":[56],"GARP.":[57],"based":[61,84],"on":[62,85],"Genetic":[63],"Algorithm":[64],"(GA)":[65],"combined":[66],"with":[67,137],"Variable":[68],"Neighborhood":[69],"Descent":[70],"(VND)":[71],"Path":[73],"Relinking":[74],"(PR).":[75],"In":[76],"addition,":[77],"used":[79],"a":[80,86],"local":[81],"search":[82],"method":[83],"Mixed-Integer":[87],"Programming":[88],"(MIP)":[89],"model":[90],"solve":[92],"Asymmetric":[94],"Traveling":[95],"Salesman":[96],"(ATSP).":[98],"developed":[100],"explores":[102],"solution":[104],"space":[105],"using":[106,115],"multiple":[107],"insertions":[108],"swaps":[110],"movements.":[111],"GARP":[112],"was":[113],"tested":[114],"benchmark":[116],"instances":[117],"computational":[120],"results":[121],"showed":[122],"that":[123],"it":[124],"able":[126],"produce":[128],"better":[129],"solutions":[130],"than":[131],"algorithms":[133],"literature,":[136],"lower":[138],"variability":[139],"setting":[141],"new":[142],"upper":[143],"bounds":[144],"for":[145],"majority":[147],"test":[150],"problems.":[151]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2089901413","counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2024-12-06T02:54:07.771541","created_date":"2016-06-24"}