{"id":"https://openalex.org/W1994106617","doi":"https://doi.org/10.5220/0005092003780384","title":"A Self-adaptive Iterated Local Search Algorithm on the Permutation Flow Shop Scheduling Problem","display_name":"A Self-adaptive Iterated Local Search Algorithm on the Permutation Flow Shop Scheduling Problem","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W1994106617","doi":"https://doi.org/10.5220/0005092003780384","mag":"1994106617"},"language":"en","primary_location":{"id":"doi:10.5220/0005092003780384","is_oa":true,"landing_page_url":"https://doi.org/10.5220/0005092003780384","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th International Conference on Informatics in Control, Automation and Robotics","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.5220/0005092003780384","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102211758","display_name":"Xingye Dong","orcid":null},"institutions":[{"id":"https://openalex.org/I21193070","display_name":"Beijing Jiaotong University","ror":"https://ror.org/01yj56c84","country_code":"CN","type":"education","lineage":["https://openalex.org/I21193070"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Xingye Dong","raw_affiliation_strings":["Beijing Jiaotong University, China","Beijing Key Lab of Traffic Data Analysis and Mining, School of Computer and IT, Beijing Jiaotong University, 100044, China"],"affiliations":[{"raw_affiliation_string":"Beijing Jiaotong University, China","institution_ids":["https://openalex.org/I21193070"]},{"raw_affiliation_string":"Beijing Key Lab of Traffic Data Analysis and Mining, School of Computer and IT, Beijing Jiaotong University, 100044, China","institution_ids":["https://openalex.org/I21193070"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056901803","display_name":"Maciek Nowak","orcid":"https://orcid.org/0000-0001-7612-7540"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Maciek Nowak","raw_affiliation_strings":["Loyola University, United States","Quinlan School of Business, Loyola University, Chicago, IL 60611, U.S.A"],"affiliations":[{"raw_affiliation_string":"Loyola University, United States","institution_ids":[]},{"raw_affiliation_string":"Quinlan School of Business, Loyola University, Chicago, IL 60611, U.S.A","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100400330","display_name":"Ping Chen","orcid":"https://orcid.org/0000-0003-0684-9665"},"institutions":[{"id":"https://openalex.org/I205237279","display_name":"Nankai University","ror":"https://ror.org/01y1kjr75","country_code":"CN","type":"education","lineage":["https://openalex.org/I205237279"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ping Chen","raw_affiliation_strings":["NanKai University, China","TEDA College, Nankai University, Tianjin, 300457, China"],"affiliations":[{"raw_affiliation_string":"NanKai University, China","institution_ids":["https://openalex.org/I205237279"]},{"raw_affiliation_string":"TEDA College, Nankai University, Tianjin, 300457, China","institution_ids":["https://openalex.org/I205237279"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013548083","display_name":"Youfang Lin","orcid":"https://orcid.org/0000-0002-5143-3645"},"institutions":[{"id":"https://openalex.org/I21193070","display_name":"Beijing Jiaotong University","ror":"https://ror.org/01yj56c84","country_code":"CN","type":"education","lineage":["https://openalex.org/I21193070"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Youfang Lin","raw_affiliation_strings":["Beijing Jiaotong University, China","Beijing Key Lab of Traffic Data Analysis and Mining, School of Computer and IT, Beijing Jiaotong University, 100044, China"],"affiliations":[{"raw_affiliation_string":"Beijing Jiaotong University, China","institution_ids":["https://openalex.org/I21193070"]},{"raw_affiliation_string":"Beijing Key Lab of Traffic Data Analysis and Mining, School of Computer and IT, Beijing Jiaotong University, 100044, China","institution_ids":["https://openalex.org/I21193070"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5102211758"],"corresponding_institution_ids":["https://openalex.org/I21193070"],"apc_list":null,"apc_paid":null,"fwci":0.6158,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.73875634,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"378","last_page":"384"},"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.992900013923645,"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/T12288","display_name":"Optimization and Search Problems","score":0.9925000071525574,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/iterated-local-search","display_name":"Iterated local search","score":0.6660336256027222},{"id":"https://openalex.org/keywords/perturbation","display_name":"Perturbation (astronomy)","score":0.6646527647972107},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.6037226319313049},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.584050178527832},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.5809228420257568},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5447580814361572},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.537085235118866},{"id":"https://openalex.org/keywords/tabu-search","display_name":"Tabu search","score":0.5081808567047119},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.4772874414920807},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4686424434185028},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.46157583594322205},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.3837428092956543},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31744736433029175}],"concepts":[{"id":"https://openalex.org/C124145224","wikidata":"https://www.wikidata.org/wiki/Q6094397","display_name":"Iterated local search","level":3,"score":0.6660336256027222},{"id":"https://openalex.org/C177918212","wikidata":"https://www.wikidata.org/wiki/Q803623","display_name":"Perturbation (astronomy)","level":2,"score":0.6646527647972107},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.6037226319313049},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.584050178527832},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.5809228420257568},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5447580814361572},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.537085235118866},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.5081808567047119},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.4772874414920807},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4686424434185028},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.46157583594322205},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.3837428092956543},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31744736433029175},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.5220/0005092003780384","is_oa":true,"landing_page_url":"https://doi.org/10.5220/0005092003780384","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th International Conference on Informatics in Control, Automation and Robotics","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.5220/0005092003780384","is_oa":true,"landing_page_url":"https://doi.org/10.5220/0005092003780384","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th International Conference on Informatics in Control, Automation and Robotics","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1970320473","https://openalex.org/W1972789041","https://openalex.org/W1975172421","https://openalex.org/W2000435640","https://openalex.org/W2002147970","https://openalex.org/W2006751452","https://openalex.org/W2008665401","https://openalex.org/W2019703523","https://openalex.org/W2024085737","https://openalex.org/W2031144267","https://openalex.org/W2041091377","https://openalex.org/W2051559481","https://openalex.org/W2079003114","https://openalex.org/W2081684339","https://openalex.org/W2091479000","https://openalex.org/W2117332871","https://openalex.org/W2119518778","https://openalex.org/W2122967269","https://openalex.org/W2148948822","https://openalex.org/W2156391157","https://openalex.org/W2157846217"],"related_works":["https://openalex.org/W2052469048","https://openalex.org/W4321504838","https://openalex.org/W2081475278","https://openalex.org/W2794855054","https://openalex.org/W2005169299","https://openalex.org/W150166259","https://openalex.org/W2606087467","https://openalex.org/W1540477665","https://openalex.org/W2314520391","https://openalex.org/W2085776465"],"abstract_inverted_index":{"Iterated":[0],"local":[1,66,107],"search":[2,46],"(ILS)":[3],"is":[4,58,101,113,122,140],"a":[5,56,78],"simple,":[6],"effective":[7,141],"and":[8,68,142],"efficient":[9],"metaheuristic,":[10],"displaying":[11],"strong":[12],"performance":[13],"on":[14,131],"the":[15,45,50,62,65,70,85,92,106,110,136,150],"permutation":[16],"flow":[17,23],"shop":[18],"scheduling":[19],"problem":[20],"minimizing":[21],"total":[22],"time.":[24],"Its":[25],"perturbation":[26,51,71,111,127,138],"method":[27,57],"plays":[28],"an":[29,42],"important":[30],"role":[31],"in":[32,35],"practice.":[33],"However,":[34],"ILS,":[36],"current":[37],"methodology":[38],"does":[39],"not":[40],"use":[41],"evaluation":[43,76],"of":[44,149],"status":[47],"to":[48,74,103,115],"adjust":[49],"strength.":[52],"In":[53],"this":[54,75,126],"work,":[55],"proposed":[59,123,137],"that":[60,99,135],"evaluates":[61],"neighborhoods":[63],"around":[64],"optimum":[67],"adjusts":[69],"strength":[72,112],"according":[73],"using":[77],"technique":[79],"derived":[80],"from":[81,105],"simulated-annealing.":[82],"Basically,":[83],"if":[84],"neighboring":[86],"solutions":[87],"are":[88],"considerably":[89],"worse":[90],"than":[91,146],"best":[93],"solution":[94],"found":[95],"so":[96],"far,":[97],"indicating":[98],"it":[100],"hard":[102],"escape":[104],"optimum,":[108],"then":[109],"likely":[114],"increase.":[116],"A":[117],"self-adaptive":[118],"ILS":[119],"named":[120],"SAILS":[121,143],"by":[124],"incorporating":[125],"strategy.":[128],"Experimental":[129],"results":[130],"benchmark":[132],"instances":[133],"show":[134],"strategy":[139],"performs":[144],"better":[145],"three":[147],"state":[148],"art":[151],"algorithms.":[152]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}