{"id":"https://openalex.org/W2087206270","doi":"https://doi.org/10.1109/icca.2013.6565014","title":"A new GRASP and path relinking for single machine scheduling with sequence dependent setups","display_name":"A new GRASP and path relinking for single machine scheduling with sequence dependent setups","publication_year":2013,"publication_date":"2013-06-01","ids":{"openalex":"https://openalex.org/W2087206270","doi":"https://doi.org/10.1109/icca.2013.6565014","mag":"2087206270"},"language":"en","primary_location":{"id":"doi:10.1109/icca.2013.6565014","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icca.2013.6565014","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 10th IEEE International Conference on Control and Automation (ICCA)","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/A5100645909","display_name":"Jiaxiang Luo","orcid":"https://orcid.org/0000-0001-8603-6132"},"institutions":[{"id":"https://openalex.org/I90610280","display_name":"South China University of Technology","ror":"https://ror.org/0530pts50","country_code":"CN","type":"education","lineage":["https://openalex.org/I90610280"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Jiaxiang Luo","raw_affiliation_strings":["Automation Science and Engineering, South China University of Technology, Guangzhou, China","Automation Science and Engineering, South China University of Technology,Guangzhou,China"],"affiliations":[{"raw_affiliation_string":"Automation Science and Engineering, South China University of Technology, Guangzhou, China","institution_ids":["https://openalex.org/I90610280"]},{"raw_affiliation_string":"Automation Science and Engineering, South China University of Technology,Guangzhou,China","institution_ids":["https://openalex.org/I90610280"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101833098","display_name":"Yueming Hu","orcid":"https://orcid.org/0000-0003-3623-1188"},"institutions":[{"id":"https://openalex.org/I90610280","display_name":"South China University of Technology","ror":"https://ror.org/0530pts50","country_code":"CN","type":"education","lineage":["https://openalex.org/I90610280"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yueming Hu","raw_affiliation_strings":["Automation Science and Engineering, South China University of Technology, Guangzhou, China","Automation Science and Engineering, South China University of Technology,Guangzhou,China"],"affiliations":[{"raw_affiliation_string":"Automation Science and Engineering, South China University of Technology, Guangzhou, China","institution_ids":["https://openalex.org/I90610280"]},{"raw_affiliation_string":"Automation Science and Engineering, South China University of Technology,Guangzhou,China","institution_ids":["https://openalex.org/I90610280"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100645909"],"corresponding_institution_ids":["https://openalex.org/I90610280"],"apc_list":null,"apc_paid":null,"fwci":2.7583,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.90728677,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"490","last_page":"495"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998999834060669,"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.9998999834060669,"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.9922999739646912,"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":0.9916999936103821,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/tardiness","display_name":"Tardiness","score":0.7032284736633301},{"id":"https://openalex.org/keywords/grasp","display_name":"GRASP","score":0.6731905937194824},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5880865454673767},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5580642819404602},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5558301210403442},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4989333152770996},{"id":"https://openalex.org/keywords/changeover","display_name":"Changeover","score":0.4881311357021332},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.47292381525039673},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.46182921528816223},{"id":"https://openalex.org/keywords/single-machine-scheduling","display_name":"Single-machine scheduling","score":0.45451849699020386},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4340957999229431},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34324389696121216},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.19433194398880005}],"concepts":[{"id":"https://openalex.org/C2778047078","wikidata":"https://www.wikidata.org/wiki/Q82299449","display_name":"Tardiness","level":4,"score":0.7032284736633301},{"id":"https://openalex.org/C171268870","wikidata":"https://www.wikidata.org/wiki/Q1486676","display_name":"GRASP","level":2,"score":0.6731905937194824},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5880865454673767},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5580642819404602},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5558301210403442},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4989333152770996},{"id":"https://openalex.org/C2780129190","wikidata":"https://www.wikidata.org/wiki/Q5071912","display_name":"Changeover","level":3,"score":0.4881311357021332},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.47292381525039673},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.46182921528816223},{"id":"https://openalex.org/C2780271269","wikidata":"https://www.wikidata.org/wiki/Q19295956","display_name":"Single-machine scheduling","level":4,"score":0.45451849699020386},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4340957999229431},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34324389696121216},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.19433194398880005},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"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/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C761482","wikidata":"https://www.wikidata.org/wiki/Q118093","display_name":"Transmission (telecommunications)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icca.2013.6565014","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icca.2013.6565014","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 10th IEEE International Conference on Control and Automation (ICCA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W144556539","https://openalex.org/W179940750","https://openalex.org/W1981475023","https://openalex.org/W1993362995","https://openalex.org/W1997425713","https://openalex.org/W2034116395","https://openalex.org/W2036907167","https://openalex.org/W2047569698","https://openalex.org/W2072270250","https://openalex.org/W2080461238","https://openalex.org/W2080831875","https://openalex.org/W2088303050","https://openalex.org/W2094662666","https://openalex.org/W2122967269","https://openalex.org/W2172262914","https://openalex.org/W2521417290","https://openalex.org/W6607297876","https://openalex.org/W6727569444"],"related_works":["https://openalex.org/W3097192092","https://openalex.org/W3029619930","https://openalex.org/W2009743672","https://openalex.org/W2061005265","https://openalex.org/W74759090","https://openalex.org/W2162966494","https://openalex.org/W2951717752","https://openalex.org/W2153799489","https://openalex.org/W4251798786","https://openalex.org/W2381796141"],"abstract_inverted_index":{"Setup":[0],"(changeover)":[1],"time":[2],"is":[3,70],"often":[4],"needed":[5],"by":[6],"the":[7,21,73,77,90,135],"processes":[8],"with":[9,29,49,66,109],"operations":[10],"of":[11,93,126],"cleaning":[12],"or":[13],"changing":[14],"fixtures.":[15],"Its":[16],"length":[17],"strongly":[18],"depends":[19],"on":[20,43,123],"immediately":[22],"succeeding":[23],"operation":[24],"sometimes.":[25],"The":[26,131],"scheduling":[27,47],"problems":[28],"such":[30],"setup":[31],"times":[32],"are":[33,82],"called":[34],"to":[35,53],"have":[36],"sequence":[37,50],"dependent":[38,51],"setups.":[39],"This":[40],"paper":[41],"focuses":[42],"a":[44,83,96,124],"single":[45,120],"machine":[46],"problem":[48],"setups":[52],"minimize":[54],"total":[55],"weighted":[56],"tardiness.":[57],"A":[58],"greedy":[59],"randomized":[60],"adaptive":[61],"search":[62],"procedure":[63],"(GRASP)":[64],"combined":[65],"path":[67,100],"relinking":[68],"(PR)":[69],"proposed":[71],"for":[72],"NP-hard":[74],"problem.":[75],"In":[76],"algorithm,":[78],"our":[79,107],"main":[80],"contributions":[81],"new":[84],"iterated":[85],"filter-and-fan":[86],"(IFF)":[87],"algorithm":[88,108,122,136],"in":[89,103],"improvement":[91],"phase":[92],"GRASP":[94],"and":[95,119],"block":[97],"insertion":[98],"based":[99],"construction":[101],"method":[102],"PR.":[104],"We":[105],"compare":[106],"discrete":[110,114],"differential":[111],"evolution":[112],"(DDE),":[113],"particle":[115],"swarm":[116],"optimization":[117],"(DPSO)":[118],"IFF":[121],"set":[125],"test":[127],"instances":[128],"from":[129],"literature.":[130],"results":[132],"show":[133],"that":[134],"performs":[137],"very":[138],"competitively.":[139]},"counts_by_year":[{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}