{"id":"https://openalex.org/W2532129754","doi":"https://doi.org/10.1109/cipls.2014.7007154","title":"A Hybrid Harmony Search algorithm to minimize total weighted tardiness in the permutation flow shop","display_name":"A Hybrid Harmony Search algorithm to minimize total weighted tardiness in the permutation flow shop","publication_year":2014,"publication_date":"2014-12-01","ids":{"openalex":"https://openalex.org/W2532129754","doi":"https://doi.org/10.1109/cipls.2014.7007154","mag":"2532129754"},"language":"en","primary_location":{"id":"doi:10.1109/cipls.2014.7007154","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cipls.2014.7007154","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS)","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/A5068520287","display_name":"Mohammad Komaki","orcid":null},"institutions":[{"id":"https://openalex.org/I58956616","display_name":"Case Western Reserve University","ror":"https://ror.org/051fd9666","country_code":"US","type":"education","lineage":["https://openalex.org/I58956616"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"M. Komaki","raw_affiliation_strings":["Electrical Engineering and Computer Science Department, Case Western Reserve University, Cleveland, USA"],"affiliations":[{"raw_affiliation_string":"Electrical Engineering and Computer Science Department, Case Western Reserve University, Cleveland, USA","institution_ids":["https://openalex.org/I58956616"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060968554","display_name":"Shaya Sheikh","orcid":"https://orcid.org/0000-0001-7801-6174"},"institutions":[{"id":"https://openalex.org/I6059380","display_name":"University of Baltimore","ror":"https://ror.org/024gw2733","country_code":"US","type":"education","lineage":["https://openalex.org/I6059380"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. Sheikh","raw_affiliation_strings":["Decision Science Dept., University of Baltimore, Baltimore, USA"],"affiliations":[{"raw_affiliation_string":"Decision Science Dept., University of Baltimore, Baltimore, USA","institution_ids":["https://openalex.org/I6059380"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008485287","display_name":"Ehsan Teymourian","orcid":"https://orcid.org/0000-0003-4461-5982"},"institutions":[{"id":"https://openalex.org/I123173325","display_name":"Mazandaran University of Science and Technology","ror":"https://ror.org/03s3hf581","country_code":"IR","type":"education","lineage":["https://openalex.org/I123173325"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"E. Teymourian","raw_affiliation_strings":["Industrial Engineering Department, Mazandaran University of Science and Technology, Babol, Iran"],"affiliations":[{"raw_affiliation_string":"Industrial Engineering Department, Mazandaran University of Science and Technology, Babol, Iran","institution_ids":["https://openalex.org/I123173325"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5068520287"],"corresponding_institution_ids":["https://openalex.org/I58956616"],"apc_list":null,"apc_paid":null,"fwci":1.8473,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.88311103,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"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.9958000183105469,"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.9929999709129333,"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/harmony-search","display_name":"Harmony search","score":0.8835002779960632},{"id":"https://openalex.org/keywords/tardiness","display_name":"Tardiness","score":0.8495352268218994},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5941805839538574},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5897765755653381},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.5616924166679382},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5546410083770752},{"id":"https://openalex.org/keywords/variable-neighborhood-search","display_name":"Variable neighborhood search","score":0.5496925711631775},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5431108474731445},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.47400081157684326},{"id":"https://openalex.org/keywords/best-first-search","display_name":"Best-first search","score":0.45214328169822693},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.4194222092628479},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.3756673336029053},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3166327476501465},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.15048030018806458},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.12634965777397156}],"concepts":[{"id":"https://openalex.org/C33099171","wikidata":"https://www.wikidata.org/wiki/Q26208718","display_name":"Harmony search","level":2,"score":0.8835002779960632},{"id":"https://openalex.org/C2778047078","wikidata":"https://www.wikidata.org/wiki/Q82299449","display_name":"Tardiness","level":4,"score":0.8495352268218994},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5941805839538574},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5897765755653381},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.5616924166679382},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5546410083770752},{"id":"https://openalex.org/C2776435737","wikidata":"https://www.wikidata.org/wiki/Q7915703","display_name":"Variable neighborhood search","level":3,"score":0.5496925711631775},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5431108474731445},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.47400081157684326},{"id":"https://openalex.org/C46011968","wikidata":"https://www.wikidata.org/wiki/Q830527","display_name":"Best-first search","level":4,"score":0.45214328169822693},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4194222092628479},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.3756673336029053},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3166327476501465},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.15048030018806458},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.12634965777397156},{"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/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cipls.2014.7007154","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cipls.2014.7007154","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":0.41999998688697815,"display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W1488422606","https://openalex.org/W1586412333","https://openalex.org/W1972789041","https://openalex.org/W1973004385","https://openalex.org/W1974172836","https://openalex.org/W1977133017","https://openalex.org/W1981936740","https://openalex.org/W1985351347","https://openalex.org/W1987255189","https://openalex.org/W1993885071","https://openalex.org/W1996246029","https://openalex.org/W1997625337","https://openalex.org/W2001664299","https://openalex.org/W2006358835","https://openalex.org/W2010334716","https://openalex.org/W2016804242","https://openalex.org/W2019682546","https://openalex.org/W2033011996","https://openalex.org/W2034895205","https://openalex.org/W2039385547","https://openalex.org/W2041865494","https://openalex.org/W2047049321","https://openalex.org/W2051484002","https://openalex.org/W2057974816","https://openalex.org/W2061885878","https://openalex.org/W2067949393","https://openalex.org/W2071943729","https://openalex.org/W2074875023","https://openalex.org/W2079121918","https://openalex.org/W2081252973","https://openalex.org/W2090069860","https://openalex.org/W2113526966","https://openalex.org/W2128158656","https://openalex.org/W2130343325","https://openalex.org/W2152322909","https://openalex.org/W2153428882","https://openalex.org/W2161087400","https://openalex.org/W2163521538","https://openalex.org/W2626525886","https://openalex.org/W4210580908","https://openalex.org/W4246411990","https://openalex.org/W6739005065"],"related_works":["https://openalex.org/W2927922058","https://openalex.org/W2081821176","https://openalex.org/W2796944632","https://openalex.org/W2943986114","https://openalex.org/W2963206272","https://openalex.org/W2221471441","https://openalex.org/W2058148549","https://openalex.org/W2546679977","https://openalex.org/W1982137674","https://openalex.org/W2766851317"],"abstract_inverted_index":{"We":[0],"address":[1],"the":[2,63,78,82,93,97,101,106,114,118,128,146,153],"permutation":[3],"flow":[4],"shop":[5],"scheduling":[6],"problem":[7],"with":[8],"sequence":[9,32],"dependent":[10],"setup":[11],"times":[12],"between":[13],"jobs.":[14],"Each":[15],"job":[16],"has":[17],"its":[18],"weight":[19],"of":[20,33,40,48,70,105,117,130,152],"importance":[21],"as":[22,24,90],"well":[23],"due":[25],"date.":[26],"The":[27,133],"goal":[28],"is":[29,42,60,74,124],"to":[30,45,80,99,112,126],"find":[31],"jobs":[34,41],"such":[35],"that":[36,145],"total":[37],"weighted":[38],"tardiness":[39],"minimized.":[43],"Due":[44],"NP-Hard":[46],"complexity":[47],"this":[49],"problem,":[50],"a":[51,66],"hybrid":[52],"meta-heuristic":[53],"algorithm":[54,79,91,98,148,155],"based":[55,136],"on":[56,137],"Harmony":[57],"Search":[58,122],"Algorithm":[59,123],"developed.":[61],"In":[62,110],"proposed":[64,147],"algorithm,":[65,119],"new":[67,71],"acceptance":[68,94],"criterion":[69,95],"improvised":[72],"harmony":[73],"suggested":[75],"which":[76],"allows":[77],"explore":[81],"solution":[83],"space":[84],"in":[85,103],"earlier":[86],"iterations":[87],"(diversification),":[88],"and":[89],"progresses":[92],"leads":[96],"accept":[100],"solutions":[102],"neighborhood":[104],"current":[107],"solution,":[108],"(intensification).":[109],"order":[111],"improve":[113,127],"search":[115],"ability":[116],"Variable":[120],"Neighborhood":[121],"applied":[125],"quality":[129],"generated":[131],"harmony.":[132],"computational":[134],"experiments":[135],"well-known":[138],"benchmark":[139],"instances":[140],"are":[141],"conducted.":[142],"Results":[143],"show":[144],"outperforms":[149],"other":[150],"state":[151],"art":[154],"used":[156],"for":[157],"solving":[158],"studied":[159],"problem.":[160]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}