{"id":"https://openalex.org/W2145502967","doi":"https://doi.org/10.1109/nabic.2009.5393873","title":"Reactive GRASP with path relinking for solving parallel machines scheduling problem with resource-assignable sequence dependent setup times","display_name":"Reactive GRASP with path relinking for solving parallel machines scheduling problem with resource-assignable sequence dependent setup times","publication_year":2009,"publication_date":"2009-12-01","ids":{"openalex":"https://openalex.org/W2145502967","doi":"https://doi.org/10.1109/nabic.2009.5393873","mag":"2145502967"},"language":"en","primary_location":{"id":"doi:10.1109/nabic.2009.5393873","is_oa":false,"landing_page_url":"https://doi.org/10.1109/nabic.2009.5393873","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 World Congress on Nature & Biologically Inspired Computing (NaBIC)","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/A5066965578","display_name":"Edmar Hell Kampke","orcid":"https://orcid.org/0000-0001-5276-1483"},"institutions":[{"id":"https://openalex.org/I146165071","display_name":"Universidade Federal de Vi\u00e7osa","ror":"https://ror.org/0409dgb37","country_code":"BR","type":"education","lineage":["https://openalex.org/I146165071"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Edmar Hell Kampke","raw_affiliation_strings":["Departamento de Inform\u00e1tica, Universidade Federal de Vi\u00e7osa, Vicosa, Minas Gerais, Brazil","Departamento de Inform\u00e1tica, Universidade Federal de Vi\u00e7osa, Campus Universit\u00e1rio da UFV, 36570-000, MG, BRASIL"],"affiliations":[{"raw_affiliation_string":"Departamento de Inform\u00e1tica, Universidade Federal de Vi\u00e7osa, Vicosa, Minas Gerais, Brazil","institution_ids":["https://openalex.org/I146165071"]},{"raw_affiliation_string":"Departamento de Inform\u00e1tica, Universidade Federal de Vi\u00e7osa, Campus Universit\u00e1rio da UFV, 36570-000, MG, BRASIL","institution_ids":["https://openalex.org/I146165071"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048750231","display_name":"Jos\u00e9 Elias Claudio Arroyo","orcid":"https://orcid.org/0000-0003-3403-4770"},"institutions":[{"id":"https://openalex.org/I146165071","display_name":"Universidade Federal de Vi\u00e7osa","ror":"https://ror.org/0409dgb37","country_code":"BR","type":"education","lineage":["https://openalex.org/I146165071"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Jose Elias Claudio Arroyo","raw_affiliation_strings":["Departamento de Inform\u00e1tica, Universidade Federal de Vi\u00e7osa, Vicosa, Minas Gerais, Brazil","Departamento de Inform\u00e1tica, Universidade Federal de Vi\u00e7osa, Campus Universit\u00e1rio da UFV, 36570-000, MG, BRASIL"],"affiliations":[{"raw_affiliation_string":"Departamento de Inform\u00e1tica, Universidade Federal de Vi\u00e7osa, Vicosa, Minas Gerais, Brazil","institution_ids":["https://openalex.org/I146165071"]},{"raw_affiliation_string":"Departamento de Inform\u00e1tica, Universidade Federal de Vi\u00e7osa, Campus Universit\u00e1rio da UFV, 36570-000, MG, BRASIL","institution_ids":["https://openalex.org/I146165071"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086393146","display_name":"Andr\u00e9 Gustavo dos Santos","orcid":"https://orcid.org/0000-0002-5743-3523"},"institutions":[{"id":"https://openalex.org/I146165071","display_name":"Universidade Federal de Vi\u00e7osa","ror":"https://ror.org/0409dgb37","country_code":"BR","type":"education","lineage":["https://openalex.org/I146165071"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Andre Gustavo dos Santos","raw_affiliation_strings":["Departamento de Inform\u00e1tica, Universidade Federal de Vi\u00e7osa, Vicosa, Minas Gerais, Brazil","Departamento de Inform\u00e1tica, Universidade Federal de Vi\u00e7osa, Campus Universit\u00e1rio da UFV, 36570-000, MG, BRASIL"],"affiliations":[{"raw_affiliation_string":"Departamento de Inform\u00e1tica, Universidade Federal de Vi\u00e7osa, Vicosa, Minas Gerais, Brazil","institution_ids":["https://openalex.org/I146165071"]},{"raw_affiliation_string":"Departamento de Inform\u00e1tica, Universidade Federal de Vi\u00e7osa, Campus Universit\u00e1rio da UFV, 36570-000, MG, BRASIL","institution_ids":["https://openalex.org/I146165071"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5066965578"],"corresponding_institution_ids":["https://openalex.org/I146165071"],"apc_list":null,"apc_paid":null,"fwci":0.7505,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.79134793,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"924","last_page":"929"},"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.9941999912261963,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9940000176429749,"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/grasp","display_name":"GRASP","score":0.9055213928222656},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6708098649978638},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.6369407773017883},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6093886494636536},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5776086449623108},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5328415632247925},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4204511046409607},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.392543762922287},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2552642822265625}],"concepts":[{"id":"https://openalex.org/C171268870","wikidata":"https://www.wikidata.org/wiki/Q1486676","display_name":"GRASP","level":2,"score":0.9055213928222656},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6708098649978638},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.6369407773017883},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6093886494636536},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5776086449623108},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5328415632247925},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4204511046409607},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.392543762922287},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2552642822265625},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","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},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/nabic.2009.5393873","is_oa":false,"landing_page_url":"https://doi.org/10.1109/nabic.2009.5393873","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 World Congress on Nature & Biologically Inspired Computing (NaBIC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7400000095367432,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320322025","display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","ror":"https://ror.org/03swz6y49"},{"id":"https://openalex.org/F4320322980","display_name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de Minas Gerais","ror":"https://ror.org/00nc55f03"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W179940750","https://openalex.org/W192551852","https://openalex.org/W1977846845","https://openalex.org/W1992482951","https://openalex.org/W2010643995","https://openalex.org/W2011818161","https://openalex.org/W2028438572","https://openalex.org/W2038806264","https://openalex.org/W2039555760","https://openalex.org/W2075232483","https://openalex.org/W2078999064","https://openalex.org/W2079641336","https://openalex.org/W2092097317","https://openalex.org/W2130879453","https://openalex.org/W4251046429","https://openalex.org/W6607297876"],"related_works":["https://openalex.org/W2163296013","https://openalex.org/W2743859443","https://openalex.org/W2326995835","https://openalex.org/W982603479","https://openalex.org/W4294811694","https://openalex.org/W2103084658","https://openalex.org/W2055379348","https://openalex.org/W2931664688","https://openalex.org/W2523147401","https://openalex.org/W4243663106"],"abstract_inverted_index":{"This":[0],"paper":[1],"addresses":[2],"an":[3,46,86],"unrelated":[4],"parallel":[5],"machine":[6,9],"problem":[7],"with":[8,115],"and":[10,29],"job":[11],"sequence":[12],"dependent":[13],"setup":[14],"times.":[15],"The":[16,83,106],"objective":[17],"function":[18],"considered":[19],"is":[20,70],"a":[21],"linear":[22],"combination":[23],"of":[24,33,41,62,76],"the":[25,30,38,50,55,60,63,67,74,77,91,110,116,121],"total":[26,31],"completion":[27],"time":[28],"number":[32],"resources":[34],"assigned.":[35],"Due":[36],"to":[37,73],"combinatorial":[39],"complexity":[40],"this":[42],"problem,":[43],"we":[44],"propose":[45],"algorithm":[47,84,112],"based":[48,89],"on":[49,90],"GRASP":[51],"metaheuristic,":[52],"in":[53,97,120],"which":[54,95],"basic":[56],"parameter":[57],"that":[58],"defines":[59],"restrictiveness":[61],"candidate":[64],"list":[65],"during":[66],"construction":[68],"phase":[69],"self-adjusted":[71],"according":[72],"quality":[75],"solutions":[78,102],"previously":[79],"found":[80,103],"(reactive":[81],"GRASP).":[82],"uses":[85],"intensification":[87],"strategy":[88],"path":[92],"relinking":[93],"technique":[94],"consists":[96],"exploring":[98],"paths":[99],"between":[100],"elite":[101],"by":[104,109],"GRASP.":[105],"results":[107,118],"obtained":[108],"proposed":[111],"are":[113],"compared":[114],"best":[117],"available":[119],"literature.":[122]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}