{"id":"https://openalex.org/W2265119834","doi":"https://doi.org/10.3233/ica-150500","title":"An enhanced greedy random adaptive search procedure with path-relinking for no-wait flowshop problem with setup times","display_name":"An enhanced greedy random adaptive search procedure with path-relinking for no-wait flowshop problem with setup times","publication_year":2015,"publication_date":"2015-12-08","ids":{"openalex":"https://openalex.org/W2265119834","doi":"https://doi.org/10.3233/ica-150500","mag":"2265119834"},"language":"en","primary_location":{"id":"doi:10.3233/ica-150500","is_oa":false,"landing_page_url":"https://doi.org/10.3233/ica-150500","pdf_url":null,"source":{"id":"https://openalex.org/S107631664","display_name":"Integrated Computer-Aided Engineering","issn_l":"1069-2509","issn":["1069-2509","1875-8835"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Integrated Computer-Aided Engineering","raw_type":"journal-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/A5100513664","display_name":"Xia Zhu","orcid":null},"institutions":[{"id":"https://openalex.org/I76569877","display_name":"Southeast University","ror":"https://ror.org/04ct4d772","country_code":"CN","type":"education","lineage":["https://openalex.org/I76569877"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xia Zhu","raw_affiliation_strings":["Key Laboratory of Computer Network and Information Integration, Ministry of Education, Nanjing, Jiangsu, China","School of Computer Science and Engineering, Southeast University, Nanjing, Jiangsu, China"],"affiliations":[{"raw_affiliation_string":"Key Laboratory of Computer Network and Information Integration, Ministry of Education, Nanjing, Jiangsu, China","institution_ids":[]},{"raw_affiliation_string":"School of Computer Science and Engineering, Southeast University, Nanjing, Jiangsu, China","institution_ids":["https://openalex.org/I76569877"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041611973","display_name":"Xiaoping Li","orcid":"https://orcid.org/0000-0003-3201-0038"},"institutions":[{"id":"https://openalex.org/I76569877","display_name":"Southeast University","ror":"https://ror.org/04ct4d772","country_code":"CN","type":"education","lineage":["https://openalex.org/I76569877"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Xiaoping Li","raw_affiliation_strings":["Key Laboratory of Computer Network and Information Integration, Ministry of Education, Nanjing, Jiangsu, China","School of Computer Science and Engineering, Southeast University, Nanjing, Jiangsu, China"],"affiliations":[{"raw_affiliation_string":"Key Laboratory of Computer Network and Information Integration, Ministry of Education, Nanjing, Jiangsu, China","institution_ids":[]},{"raw_affiliation_string":"School of Computer Science and Engineering, Southeast University, Nanjing, Jiangsu, China","institution_ids":["https://openalex.org/I76569877"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5041611973"],"corresponding_institution_ids":["https://openalex.org/I76569877"],"apc_list":null,"apc_paid":null,"fwci":2.3036,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.89344593,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"23","issue":"1","first_page":"51","last_page":"68"},"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9980999827384949,"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.9939000010490417,"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/heuristics","display_name":"Heuristics","score":0.7441500425338745},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7313037514686584},{"id":"https://openalex.org/keywords/tabu-search","display_name":"Tabu search","score":0.6495779752731323},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6301367282867432},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5924367904663086},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.5422658920288086},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.533948540687561},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5195813179016113},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5063949823379517},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4711384177207947},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.4283870458602905},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38811174035072327},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3015403747558594},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.06671607494354248}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7441500425338745},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7313037514686584},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.6495779752731323},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6301367282867432},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5924367904663086},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.5422658920288086},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.533948540687561},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5195813179016113},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5063949823379517},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4711384177207947},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.4283870458602905},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38811174035072327},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3015403747558594},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.06671607494354248},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"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/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/ica-150500","is_oa":false,"landing_page_url":"https://doi.org/10.3233/ica-150500","pdf_url":null,"source":{"id":"https://openalex.org/S107631664","display_name":"Integrated Computer-Aided Engineering","issn_l":"1069-2509","issn":["1069-2509","1875-8835"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Integrated Computer-Aided Engineering","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5199999809265137,"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W179940750","https://openalex.org/W1039101565","https://openalex.org/W1483648899","https://openalex.org/W1486707681","https://openalex.org/W1488248946","https://openalex.org/W1506907661","https://openalex.org/W1530389021","https://openalex.org/W1745273410","https://openalex.org/W1891716741","https://openalex.org/W1967029759","https://openalex.org/W1967761074","https://openalex.org/W1969495992","https://openalex.org/W1971110338","https://openalex.org/W1973595511","https://openalex.org/W1977133017","https://openalex.org/W1986547858","https://openalex.org/W1993586093","https://openalex.org/W2001386238","https://openalex.org/W2004260750","https://openalex.org/W2008207174","https://openalex.org/W2013303203","https://openalex.org/W2013323324","https://openalex.org/W2041865494","https://openalex.org/W2042007290","https://openalex.org/W2043496704","https://openalex.org/W2053134549","https://openalex.org/W2068003474","https://openalex.org/W2081802723","https://openalex.org/W2090275183","https://openalex.org/W2094485034","https://openalex.org/W2099861483","https://openalex.org/W2107473204","https://openalex.org/W2120572648","https://openalex.org/W2127890299","https://openalex.org/W2149884725","https://openalex.org/W2151659268","https://openalex.org/W2156391157","https://openalex.org/W2157793635","https://openalex.org/W2168406421","https://openalex.org/W2170393333","https://openalex.org/W2351869296","https://openalex.org/W2386225009","https://openalex.org/W2889441383"],"related_works":["https://openalex.org/W4321504838","https://openalex.org/W2794855054","https://openalex.org/W2937685542","https://openalex.org/W2081475278","https://openalex.org/W2005169299","https://openalex.org/W150166259","https://openalex.org/W2085776465","https://openalex.org/W1540477665","https://openalex.org/W2314520391","https://openalex.org/W3087663609"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"consider":[4],"the":[5,32,35,41,55,58,73,82,93,119,123,131],"no-wait":[6],"flowshop":[7,102],"scheduling":[8,103],"problem":[9,42,95],"with":[10,31,65,89,105,122],"sequence-dependent":[11,106],"setup":[12,107],"times":[13,108],"to":[14,53,71,80],"minimize":[15],"makespan,":[16],"which":[17],"is":[18,29,38,51,78,87],"widespread":[19],"in":[20],"industries.":[21],"An":[22,46,75],"enhanced":[23],"greedy":[24],"random":[25],"adaptive":[26],"search":[27,49,59,63],"procedure":[28],"combined":[30],"Path-Relinking":[33],"and":[34,66,96],"GRPEP":[36,116,126],"method":[37],"proposed":[39,85],"for":[40,92,101],"un":[43],"der":[44],"study.":[45],"evolutionary":[47],"local":[48,62],"algorithm":[50,86],"integrated":[52],"improve":[54,72],"exploration":[56],"of":[57],"process.":[60],"Two":[61],"methods,":[64],"without":[67],"memory,":[68],"are":[69],"introduced":[70],"intensification.":[74],"ageing":[76],"strategy":[77],"developed":[79],"increase":[81],"diversification.":[83],"The":[84],"compared":[88,120,132],"existing":[90],"approaches":[91],"considered":[94],"some":[97],"recent":[98],"effective":[99],"algorithms":[100],"problems":[104],"on":[109],"benchmark":[110],"instances.":[111],"Experimental":[112],"results":[113],"show":[114],"that":[115],"outperforms":[117],"all":[118],"meta-heuristics":[121],"same":[124],"CPU-times.":[125],"obtains":[127],"better":[128],"solutions":[129],"than":[130],"heuristics":[133]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-02T15:55:50.835912","created_date":"2025-10-10T00:00:00"}