{"id":"https://openalex.org/W2144697362","doi":"https://doi.org/10.1109/scis.2009.4927016","title":"A local search heuristic with self-tuning parameter for permutation flow-shop scheduling problem","display_name":"A local search heuristic with self-tuning parameter for permutation flow-shop scheduling problem","publication_year":2009,"publication_date":"2009-03-01","ids":{"openalex":"https://openalex.org/W2144697362","doi":"https://doi.org/10.1109/scis.2009.4927016","mag":"2144697362"},"language":"en","primary_location":{"id":"doi:10.1109/scis.2009.4927016","is_oa":false,"landing_page_url":"https://doi.org/10.1109/scis.2009.4927016","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE Symposium on Computational Intelligence in Scheduling","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/A5056092705","display_name":"Berna Dengiz","orcid":"https://orcid.org/0000-0002-2806-3308"},"institutions":[{"id":"https://openalex.org/I188740104","display_name":"Ba\u015fkent University","ror":"https://ror.org/02v9bqx10","country_code":"TR","type":"education","lineage":["https://openalex.org/I188740104"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Berna Dengiz","raw_affiliation_strings":["Department of Industrial Engineering, Baskent University, Ankara, Turkey","Department of Industrial Engineering, Baskent University, 06530, Ankara, Turkey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering, Baskent University, Ankara, Turkey","institution_ids":["https://openalex.org/I188740104"]},{"raw_affiliation_string":"Department of Industrial Engineering, Baskent University, 06530, Ankara, Turkey","institution_ids":["https://openalex.org/I188740104"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029424127","display_name":"\u00c7i\u011fdem Alaba\u015f-Uslu","orcid":"https://orcid.org/0000-0002-4594-1360"},"institutions":[{"id":"https://openalex.org/I44457188","display_name":"Maltepe University","ror":"https://ror.org/004dg2369","country_code":"TR","type":"education","lineage":["https://openalex.org/I44457188"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Cigdem Alabas-Uslu","raw_affiliation_strings":["Department of Industrial Engineering, Maltepe University, Istanbul, Turkey","Department of Industrial Engineering, Maltepe University, 34857, Istanbul, Turkey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering, Maltepe University, Istanbul, Turkey","institution_ids":["https://openalex.org/I44457188"]},{"raw_affiliation_string":"Department of Industrial Engineering, Maltepe University, 34857, Istanbul, Turkey","institution_ids":["https://openalex.org/I44457188"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012201764","display_name":"\u0130hsan Sabuncuo\u011flu","orcid":null},"institutions":[{"id":"https://openalex.org/I168864056","display_name":"Bilkent University","ror":"https://ror.org/02vh8a032","country_code":"TR","type":"education","lineage":["https://openalex.org/I168864056"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Ihsan Sabuncuoglu","raw_affiliation_strings":["Department of Industrial Engineering, Bilkent University, Ankara, Turkey","Department of Industrial Engineering, Bilkent University 06800 Ankara, Turkey#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering, Bilkent University, Ankara, Turkey","institution_ids":["https://openalex.org/I168864056"]},{"raw_affiliation_string":"Department of Industrial Engineering, Bilkent University 06800 Ankara, Turkey#TAB#","institution_ids":["https://openalex.org/I168864056"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.20883499,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"118","issue":null,"first_page":"62","last_page":"67"},"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.9973999857902527,"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.9968000054359436,"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/tabu-search","display_name":"Tabu search","score":0.7540919780731201},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.73824542760849},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.6726688146591187},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6554086208343506},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6494235992431641},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6295384168624878},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.5594743490219116},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5536400675773621},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.5426034331321716},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.5195920467376709},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4676617681980133},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3504042327404022},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2575119137763977},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.0832875669002533}],"concepts":[{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.7540919780731201},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.73824542760849},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.6726688146591187},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6554086208343506},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6494235992431641},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6295384168624878},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.5594743490219116},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5536400675773621},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.5426034331321716},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.5195920467376709},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4676617681980133},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3504042327404022},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2575119137763977},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.0832875669002533},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/scis.2009.4927016","is_oa":false,"landing_page_url":"https://doi.org/10.1109/scis.2009.4927016","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE Symposium on Computational Intelligence in Scheduling","raw_type":"proceedings-article"},{"id":"pmh:oai:repository.bilkent.edu.tr:11693/26748","is_oa":false,"landing_page_url":"http://hdl.handle.net/11693/26748","pdf_url":null,"source":{"id":"https://openalex.org/S4306400079","display_name":"Bilkent University Institutional Repository (Bilkent University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I168864056","host_organization_name":"Bilkent University","host_organization_lineage":["https://openalex.org/I168864056"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2009","raw_type":"Conference Paper"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.4300000071525574,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1488422606","https://openalex.org/W1977033367","https://openalex.org/W1985351347","https://openalex.org/W1993433489","https://openalex.org/W2001664299","https://openalex.org/W2004274396","https://openalex.org/W2024060531","https://openalex.org/W2024085737","https://openalex.org/W2030910540","https://openalex.org/W2031585418","https://openalex.org/W2084792706","https://openalex.org/W2125827607","https://openalex.org/W2157846217","https://openalex.org/W4242574915"],"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":{"In":[0,16],"this":[1,24],"paper,":[2],"a":[3,54],"new":[4],"local":[5,124],"search":[6,84,125],"metaheuristic":[7],"is":[8,59,92],"proposed":[9,49],"for":[10,94],"the":[11,38,43,67,72,76,80,83,90,95,99,111],"permutation":[12],"flow-shop":[13],"scheduling":[14],"problem.":[15],"general,":[17],"metaheuristics":[18],"are":[19,33,122],"widely":[20],"used":[21],"to":[22,27,36,45],"solve":[23,37],"problem":[25,73],"due":[26],"its":[28],"NP-completeness.":[29],"Although":[30],"these":[31],"heuristics":[32],"quite":[34],"effective":[35],"problem,":[39],"they":[40],"suffer":[41],"from":[42],"need":[44],"optimize":[46],"parameters.":[47],"The":[48],"heuristic,":[50],"named":[51],"STLS,":[52],"has":[53],"single":[55],"self-tuning":[56],"parameter":[57],"which":[58,121],"calculated":[60],"and":[61,75,109,117],"updated":[62],"dynamically":[63],"based":[64,126],"on":[65],"both":[66],"response":[68],"surface":[69],"information":[70],"of":[71,79,89,98],"field":[74],"performance":[77],"measure":[78],"method":[81],"throughout":[82],"process.":[85],"Especially,":[86],"application":[87],"simplicity":[88],"algorithm":[91],"attractive":[93],"users.":[96],"Results":[97],"experimental":[100],"study":[101],"show":[102],"that":[103],"STLS":[104],"generates":[105],"high":[106],"quality":[107],"solutions":[108],"outperforms":[110],"basic":[112],"tabu":[113],"search,":[114],"simulated":[115],"annealing,":[116],"record-to-record":[118],"travel":[119],"algorithms":[120],"well-known":[123],"metaheuristics.":[127]},"counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}