{"id":"https://openalex.org/W3114999995","doi":"https://doi.org/10.1162/evco_a_00287","title":"Iterated Local Search and Other Algorithms for Buffered Two-Machine Permutation Flow Shops with Constant Processing Times on One Machine","display_name":"Iterated Local Search and Other Algorithms for Buffered Two-Machine Permutation Flow Shops with Constant Processing Times on One Machine","publication_year":2020,"publication_date":"2020-12-22","ids":{"openalex":"https://openalex.org/W3114999995","doi":"https://doi.org/10.1162/evco_a_00287","mag":"3114999995","pmid":"https://pubmed.ncbi.nlm.nih.gov/34467994"},"language":"en","primary_location":{"id":"doi:10.1162/evco_a_00287","is_oa":false,"landing_page_url":"https://doi.org/10.1162/evco_a_00287","pdf_url":null,"source":{"id":"https://openalex.org/S38677346","display_name":"Evolutionary Computation","issn_l":"1063-6560","issn":["1063-6560","1530-9304"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718"],"host_organization_lineage_names":["The MIT Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","pubmed"],"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/A5103108506","display_name":"Hoang Thanh Le","orcid":"https://orcid.org/0000-0003-3963-0467"},"institutions":[{"id":"https://openalex.org/I926574661","display_name":"Leipzig University","ror":"https://ror.org/03s7gtk40","country_code":"DE","type":"education","lineage":["https://openalex.org/I926574661"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Hoang Thanh Le","raw_affiliation_strings":["Department of Computer Science, Leipzig University, Leipzig, 04109, Germany lht@informatik.uni-leipzig.de"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Leipzig University, Leipzig, 04109, Germany lht@informatik.uni-leipzig.de","institution_ids":["https://openalex.org/I926574661"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039216265","display_name":"Philine Geser","orcid":null},"institutions":[{"id":"https://openalex.org/I926574661","display_name":"Leipzig University","ror":"https://ror.org/03s7gtk40","country_code":"DE","type":"education","lineage":["https://openalex.org/I926574661"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Philine Geser","raw_affiliation_strings":["Department of Computer Science, Leipzig University, Leipzig, 04109, Germany philine-geser@gmx.net"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Leipzig University, Leipzig, 04109, Germany philine-geser@gmx.net","institution_ids":["https://openalex.org/I926574661"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016253883","display_name":"Martin Middendorf","orcid":"https://orcid.org/0000-0002-5426-1092"},"institutions":[{"id":"https://openalex.org/I926574661","display_name":"Leipzig University","ror":"https://ror.org/03s7gtk40","country_code":"DE","type":"education","lineage":["https://openalex.org/I926574661"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Martin Middendorf","raw_affiliation_strings":["Department of Computer Science, Leipzig University, Leipzig, 04109, Germany middendorf@informatik.uni-leipzig.de"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Leipzig University, Leipzig, 04109, Germany middendorf@informatik.uni-leipzig.de","institution_ids":["https://openalex.org/I926574661"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5016253883","https://openalex.org/A5039216265","https://openalex.org/A5103108506"],"corresponding_institution_ids":["https://openalex.org/I926574661"],"apc_list":null,"apc_paid":null,"fwci":0.5349,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.74839707,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"29","issue":"3","first_page":"415","last_page":"439"},"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/T12176","display_name":"Optimization and Packing Problems","score":0.9965000152587891,"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.9962999820709229,"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.6687042713165283},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6478191018104553},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.6423084735870361},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.626334011554718},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6193336844444275},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.5986279845237732},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5929591655731201},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.5557003617286682},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.532441258430481},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.49614009261131287},{"id":"https://openalex.org/keywords/iterated-local-search","display_name":"Iterated local search","score":0.4917650520801544},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.42590320110321045},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3845295011997223},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.3674427270889282},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.13258910179138184}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6687042713165283},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6478191018104553},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.6423084735870361},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.626334011554718},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6193336844444275},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.5986279845237732},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5929591655731201},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.5557003617286682},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.532441258430481},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.49614009261131287},{"id":"https://openalex.org/C124145224","wikidata":"https://www.wikidata.org/wiki/Q6094397","display_name":"Iterated local search","level":3,"score":0.4917650520801544},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42590320110321045},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3845295011997223},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.3674427270889282},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.13258910179138184},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"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},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[{"descriptor_ui":"D000066506","descriptor_name":"Heuristics","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D000066506","descriptor_name":"Heuristics","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D000066506","descriptor_name":"Heuristics","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true}],"locations_count":2,"locations":[{"id":"doi:10.1162/evco_a_00287","is_oa":false,"landing_page_url":"https://doi.org/10.1162/evco_a_00287","pdf_url":null,"source":{"id":"https://openalex.org/S38677346","display_name":"Evolutionary Computation","issn_l":"1063-6560","issn":["1063-6560","1530-9304"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718"],"host_organization_lineage_names":["The MIT Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary Computation","raw_type":"journal-article"},{"id":"pmid:34467994","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/34467994","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary computation","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.5099999904632568,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":67,"referenced_works":["https://openalex.org/W350477179","https://openalex.org/W1488422606","https://openalex.org/W1533372799","https://openalex.org/W1971123384","https://openalex.org/W1995660472","https://openalex.org/W2010022068","https://openalex.org/W2010208127","https://openalex.org/W2014311301","https://openalex.org/W2017441403","https://openalex.org/W2023555714","https://openalex.org/W2024085737","https://openalex.org/W2027725385","https://openalex.org/W2027944401","https://openalex.org/W2028726945","https://openalex.org/W2032257665","https://openalex.org/W2042057184","https://openalex.org/W2043849912","https://openalex.org/W2044060832","https://openalex.org/W2046140730","https://openalex.org/W2048528925","https://openalex.org/W2051484002","https://openalex.org/W2055274492","https://openalex.org/W2059566833","https://openalex.org/W2063345867","https://openalex.org/W2067701099","https://openalex.org/W2074627161","https://openalex.org/W2075370257","https://openalex.org/W2079739541","https://openalex.org/W2089810121","https://openalex.org/W2090069860","https://openalex.org/W2103526188","https://openalex.org/W2108186618","https://openalex.org/W2133826558","https://openalex.org/W2141119792","https://openalex.org/W2149884725","https://openalex.org/W2156391157","https://openalex.org/W2157846217","https://openalex.org/W2216432406","https://openalex.org/W2279056033","https://openalex.org/W2511103365","https://openalex.org/W2624035465","https://openalex.org/W2798826944","https://openalex.org/W2886543030","https://openalex.org/W2900789887","https://openalex.org/W2930178078","https://openalex.org/W2938483102","https://openalex.org/W2941213695","https://openalex.org/W2952171133","https://openalex.org/W2959009589","https://openalex.org/W3024835624","https://openalex.org/W4233663429","https://openalex.org/W6629144528","https://openalex.org/W6649525107","https://openalex.org/W6652915085","https://openalex.org/W6660873396","https://openalex.org/W6661465743","https://openalex.org/W6663518122","https://openalex.org/W6666096544","https://openalex.org/W6672959708","https://openalex.org/W6683362155","https://openalex.org/W6725362494","https://openalex.org/W6738800772","https://openalex.org/W6750726292","https://openalex.org/W6753508061","https://openalex.org/W6761354313","https://openalex.org/W6761652932","https://openalex.org/W6815480359"],"related_works":["https://openalex.org/W2083844986","https://openalex.org/W2005660029","https://openalex.org/W2887485518","https://openalex.org/W1996453501","https://openalex.org/W1666350026","https://openalex.org/W2346455737","https://openalex.org/W3081534731","https://openalex.org/W3204855000","https://openalex.org/W2949474276","https://openalex.org/W2473338386"],"abstract_inverted_index":{"The":[0],"two-machine":[1],"permutation":[2],"flow":[3,73,137,188],"shop":[4,74,138,189],"scheduling":[5],"problem":[6],"with":[7,83,219],"buffer":[8,62,72],"is":[9,33,46,67,101,113,171,203],"studied":[10],"for":[11,41,78,133,165,186],"the":[12,22,79,84,94,98,110,135,146,162,175,192,209,214],"special":[13,95],"case":[14,32,96],"that":[15,69,124,160,174,206],"all":[16,70,106],"processing":[17,88,107],"times":[18,89,108],"on":[19,90,109],"one":[20,44,91],"of":[21,59,145,223],"two":[23,183],"machines":[24],"are":[25,64,140],"equal":[26,87],"to":[27,54,86,115],"a":[28,47,143,220],"constant":[29,99],"c.":[30],"This":[31],"interesting":[34],"because":[35],"it":[36,202],"occurs":[37],"in":[38,128],"various":[39],"applications,":[40],"example,":[42],"when":[43,51],"machine":[45,49,112],"packing":[48],"or":[50,103],"materials":[52],"have":[53],"be":[55,116],"transported.":[56],"Different":[57],"types":[58],"buffers":[60],"and":[61,152,194],"usage":[63],"considered.":[65],"It":[66,170],"shown":[68,114,172,204],"considered":[71],"problems":[75,139,190],"remain":[76],"NP-hard":[77,136],"makespan":[80],"criterion":[81],"even":[82],"restriction":[85],"machine.":[92],"However,":[93],"where":[97],"c":[100],"larger":[102],"smaller":[104,221],"than":[105,182],"other":[111],"polynomially":[117],"solvable":[118],"by":[119],"presenting":[120],"an":[121,154,195],"algorithm":[122],"(2BF-OPT)":[123],"calculates":[125],"optimal":[126],"schedules":[127],"O(nlogn)":[129],"steps.":[130],"Two":[131],"heuristics":[132],"solving":[134],"proposed:":[141],"(i)":[142],"modification":[144],"commonly":[147],"used":[148],"NEH":[149,216],"heuristic":[150,158,164,178],"(mNEH)":[151],"(ii)":[153],"Iterated":[155],"Local":[156],"Search":[157],"(2BF-ILS)":[159],"uses":[161],"mNEH":[163],"computing":[166],"its":[167],"initial":[168],"solution.":[169],"experimentally":[173,205],"proposed":[176],"2BF-ILS":[177,207],"obtains":[179,208],"better":[180],"results":[181],"state-of-the-art":[184],"algorithms":[185],"buffered":[187],"from":[191],"literature":[193],"Ant":[196],"Colony":[197],"Optimization":[198],"algorithm.":[199],"In":[200],"addition,":[201],"same":[210],"solution":[211],"quality":[212],"as":[213],"standard":[215],"heuristic,":[217],"however,":[218],"number":[222],"function":[224],"evaluations.":[225]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}